A Modular Calculus for the Average Cost of Data Structuring
Autor Michel Schellekensen Limba Engleză Paperback – 19 noi 2014
MOQA supports tracking of data and their distributions throughout computations, based on the notion of random bag preservation. This allows a unified approach to average-case time analysis, and resolves fundamental bottleneck problems in the area. The main techniques are illustrated in an accompanying Flash tutorial, where the visual nature of this method can provide new teaching ideas for algorithms courses.
This volume, with forewords by Greg Bollella and Dana Scott, presents novel programs based on the new advances in this area, including the first randomness-preserving version of Heapsort. Programs are provided, along with derivations of their average-case time, to illustrate the radically different approach to average-case timing. The automated static timing tool applies the Modular Calculus to extract the average-case running time of programs directly from their MOQA code.
A Modular Calculus for the Average Cost of Data Structuring is designed for a professional audience composed of researchers and practitioners in industry, with an interest in algorithmic analysis and also static timing and power analysis--areas of growing importance. It is also suitable as an advanced-level text or reference book for students in computer science, electrical engineering and mathematics.
Michel Schellekens obtained his PhD from Carnegie Mellon University, following which he worked as a Marie Curie Fellow at Imperial College London. Currently he is an Associate Professor at the Department of Computer Science in University College Cork - National University of Ireland, Cork, where he leads the Centre for Efficiency-Oriented Languages (CEOL) as a Science Foundation Ireland Principal Investigator.
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (1) | 631.29 lei 43-57 zile | |
Springer Us – 19 noi 2014 | 631.29 lei 43-57 zile | |
Hardback (1) | 636.78 lei 43-57 zile | |
Springer Us – 2 iul 2008 | 636.78 lei 43-57 zile |
Preț: 631.29 lei
Preț vechi: 789.12 lei
-20% Nou
Puncte Express: 947
Preț estimativ în valută:
120.82€ • 125.50$ • 100.36£
120.82€ • 125.50$ • 100.36£
Carte tipărită la comandă
Livrare economică 03-17 februarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9781489999061
ISBN-10: 148999906X
Pagini: 272
Ilustrații: XXIV, 245 p.
Dimensiuni: 155 x 235 x 14 mm
Greutate: 0.39 kg
Ediția:2008
Editura: Springer Us
Colecția Springer
Locul publicării:New York, NY, United States
ISBN-10: 148999906X
Pagini: 272
Ilustrații: XXIV, 245 p.
Dimensiuni: 155 x 235 x 14 mm
Greutate: 0.39 kg
Ediția:2008
Editura: Springer Us
Colecția Springer
Locul publicării:New York, NY, United States
Public țintă
ResearchCuprins
Introductory Notions.- Compositionality.- Random Bag Preservation and Isolated Subsets.- Basic MOQA Operations.- Average-Case Time of Basic MOQA Operations.- The MOQA Language.- Examples of MOQA Programs.- Average-Case Analysis of MOQA programs.- Distri-Track Joint with D. Hickey and M. Boubekeur.- Conclusion and FutureWork.
Textul de pe ultima copertă
A Modular Calculus for the Average Cost of Data Structuring introduces MOQA, a new domain-specific programming language which guarantees the average-case time analysis of its programs to be modular.Time in this context refers to a broad notion of cost, which can be used to estimate the actual running time, but also other quantitative information such as power consumption, while modularity means that the average time of a program can be easily computed from the times of its constituents--something that no programming language of this scope has been able to guarantee so far. MOQA principles can be incorporated in any standard programming language.
MOQA supports tracking of data and their distributions throughout computations, based on the notion of random bag preservation. This allows a unified approach to average-case time analysis, and resolves fundamental bottleneck problems in the area. The main techniques are illustrated in an accompanying Flash tutorial, where the visual nature of this method can provide new teaching ideas for algorithms courses.
This volume, with forewords by Greg Bollella and Dana Scott, presents novel programs based on the new advances in this area, including the first randomness-preserving version of Heapsort. Programs are provided, along with derivations of their average-case time, to illustrate the radically different approach to average-case timing. The automated static timing tool applies the Modular Calculus to extract the average-case running time of programs directly from their MOQA code.
A Modular Calculus for the Average Cost of Data Structuring is designed for a professional audience composed of researchers and practitioners in industry, with an interest in algorithmic analysis and also static timing and power analysis--areas of growing importance. It is also suitable as an advanced-level text or reference book for students in computer science,electrical engineering and mathematics.
Michel Schellekens obtained his PhD from Carnegie Mellon University, following which he worked as a Marie Curie Fellow at Imperial College London. Currently he is an Associate Professor at the Department of Computer Science in University College Cork - National University of Ireland, Cork, where he leads the Centre for Efficiency-Oriented Languages (CEOL) as a Science Foundation Ireland Principal Investigator.
MOQA supports tracking of data and their distributions throughout computations, based on the notion of random bag preservation. This allows a unified approach to average-case time analysis, and resolves fundamental bottleneck problems in the area. The main techniques are illustrated in an accompanying Flash tutorial, where the visual nature of this method can provide new teaching ideas for algorithms courses.
This volume, with forewords by Greg Bollella and Dana Scott, presents novel programs based on the new advances in this area, including the first randomness-preserving version of Heapsort. Programs are provided, along with derivations of their average-case time, to illustrate the radically different approach to average-case timing. The automated static timing tool applies the Modular Calculus to extract the average-case running time of programs directly from their MOQA code.
A Modular Calculus for the Average Cost of Data Structuring is designed for a professional audience composed of researchers and practitioners in industry, with an interest in algorithmic analysis and also static timing and power analysis--areas of growing importance. It is also suitable as an advanced-level text or reference book for students in computer science,electrical engineering and mathematics.
Michel Schellekens obtained his PhD from Carnegie Mellon University, following which he worked as a Marie Curie Fellow at Imperial College London. Currently he is an Associate Professor at the Department of Computer Science in University College Cork - National University of Ireland, Cork, where he leads the Centre for Efficiency-Oriented Languages (CEOL) as a Science Foundation Ireland Principal Investigator.
Caracteristici
Novel foundation provided for this classical area of computing As opposed to series of methods to match algorithm under consideration, new uniform foundation is provided: semi-automatable, providing single approach to analyze all algorithms from a wide class Introduces modular static analysis tool Distri-Track, developed at the author's research center--based on new modular calculus for average-case analysis Includes supplementary material: sn.pub/extras