Algorithm Synthesis: A Comparative Study

David M. Steier et A. Penny Anderson

ISBN 10: 0387969608 / ISBN 13: 9780387969602

Editore: Springer-Verlag New York Inc., 1989

Ancien livre de bibliothèque. Edition 1989. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Very good. Former library book. Edition 1989. Ammareal gives back up to 15% of this item's net price to charity organizations. Codice articolo E-577-941

Riassunto:

In early 1986, one of us (D.M.S.) was constructing an artificial intelligence system to design algorithms, and the other (A.P.A.) was getting started in program transformations research. We shared an office, and exchanged a few papers on the systematic development of algorithms from specifications. Gradually we realized that we were trying to solve some of the same problems. And so, despite radical differences between ourselves in research approaches, we set out together to see what we could learn from these papers. That's how this book started: a couple of graduate students trying to cope with The Literature. At first, there was just a list of papers. One of us (D.M.S.) tried to cast the papers in a uniform framework by describing the problem spaces searched, an approach used in artificial intelligence for understanding many tasks. The generalized problem space descriptions, though useful, seemed to abstract too much, so we decided to compare papers by different authors dealing with the same algorithm. These comparisons proved crucial: for then we began to see similar key design choices for each algorithm.

Contenuti: 1 Introduction.- 2 Insertion Sort.- 2.1. Green and Barstow.- 2.2. Broy.- 2.3. Smith.- 2.4. Clark and Darlington.- 2.5. Composite.- 3 Quicksort.- 3.1. Green and Barstow.- 3.2. Broy.- 3.3. Smith.- 3.4. Clark and Darlington.- 3.5. Composite.- 4 Cartesian Set Product.- 4.1. Manna and Waldinger.- 4.2. Smith.- 4.3. Composite.- 5 Depth-First Search.- 5.1. Broy and Pepper.- 5.2. Reif and Scherlis.- 5.3. Gerhart.- 5.4. Barstow.- 5.5. Composite.- 6 Schorr-Waite Graph Marking.- 6.1. Broy and Pepper.- 6.2. Gerhart.- 6.3. Griffiths.- 6.4. Composite.- 7 N-Queens.- 7.1. Balzer.- 7.2. Smith.- 7.3. Wirth.- 7.4. Composite.- 8 Convex Hull.- 8.1. Smith.- 8.2. Kant and Newell.- 8.3. Composite.- 9 Design Space: The Final Frontier.- 9.1. Goals.- 9.2. Languages.- 9.3. Derivation Structure.- 9.4. Implementations.- 9.5. Presentation Styles.- References.

Dati bibliografici

Titolo: Algorithm Synthesis: A Comparative Study
Casa editrice: Springer-Verlag New York Inc.
Data di pubblicazione: 1989
Legatura: Softcover
Condizione: Très bon