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.
"Sinopsis" puede pertenecer a otra edición de este libro.
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.
This book presents a uniform framework for presenting and comparing derivations of algorithms, and applies this framework to analyze various derivations found in the literature for seven algorithms. The authors have selected algorithms for which multiple derivations exist. The framework developed abstracts from individual presentation styles and notations to focus on what was accomplished at each step of a derivation, and on the rationale for each design choice. Charts for each presentation capture this information using informal and readable conventions, while the composite graphs and associated text highlight important similarities and differences about a group of presentations for each of the seven algorithms. This indepth study of the diversity of algorithm derivations attempts to identify issues in the areas of design goals, languages, derivation structure, implementations, and presentation style. The seven algorithms studied are: insertion sort, quicksort, cartesian set product, depth-first search in a directed graph, Schorr-Waite graph marking, n-queens, and convex hull. The book will be of interest to computer science researchers and practitioners and to applied mathematicians with specific interests in the areas of programming systems, program transformations, algorithm design, automatic programming, software engineering, and artificial intelligence.
"Sobre este título" puede pertenecer a otra edición de este libro.
Librería: Ammareal, Morangis, Francia
Softcover. Condición: Très bon. 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. Nº de ref. del artículo: E-577-941
Cantidad disponible: 1 disponibles
Librería: Books From California, Simi Valley, CA, Estados Unidos de America
paperback. Condición: Good. Ex-library copy with stamps and stickers. The pages are lightly tanned. The copy shows minor external wear, but is in otherwise clean condition. Nº de ref. del artículo: mon0004046036
Cantidad disponible: 1 disponibles
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 132 pp. Englisch. Nº de ref. del artículo: 9780387969602
Cantidad disponible: 2 disponibles
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Condición: New. In. Nº de ref. del artículo: ria9780387969602_new
Cantidad disponible: Más de 20 disponibles
Librería: moluna, Greven, Alemania
Kartoniert / Broschiert. Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 deve. Nº de ref. del artículo: 5912875
Cantidad disponible: Más de 20 disponibles
Librería: Books Puddle, New York, NY, Estados Unidos de America
Condición: New. pp. 132. Nº de ref. del artículo: 263876771
Cantidad disponible: 4 disponibles
Librería: Majestic Books, Hounslow, Reino Unido
Condición: New. Print on Demand pp. 132 Illus. Nº de ref. del artículo: 5019772
Cantidad disponible: 4 disponibles
Librería: Revaluation Books, Exeter, Reino Unido
Paperback. Condición: Brand New. 127 pages. 9.02x5.98x0.30 inches. In Stock. Nº de ref. del artículo: x-0387969608
Cantidad disponible: 2 disponibles
Librería: Biblios, Frankfurt am main, HESSE, Alemania
Condición: New. PRINT ON DEMAND pp. 132. Nº de ref. del artículo: 183876777
Cantidad disponible: 4 disponibles
Librería: preigu, Osnabrück, Alemania
Taschenbuch. Condición: Neu. Algorithm Synthesis: A Comparative Study | A. Penny Anderson (u. a.) | Taschenbuch | ix | Englisch | 1989 | Springer US | EAN 9780387969602 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. Nº de ref. del artículo: 106642395
Cantidad disponible: 5 disponibles