Algorithm Synthesis: A Comparative Study /

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 ab...

Full description

Bibliographic Details
Main Author: Steier, D. M.
Corporate Author: SpringerLink (Online service)
Other Authors: Anderson, A. P.
Format: eBook
Language:English
Published: New York, NY : Springer US, 1989.
Subjects:
Online Access:Connect to the full text of this electronic book

MARC

Tag First Indicator Second Indicator Subfields
LEADER 00000cam a2200000Ma 4500
001 in00003554670
006 m o d
007 cr nn|||||||||
008 121227s1989 nyua o 000 0 eng d
005 20260422214839.4
020 |a 9781461388777 (electronic bk.) 
020 |a 1461388775 (electronic bk.) 
035 |a (OCoLC)840282950 
040 |a I9W  |b eng  |e pn  |c I9W  |d UV0  |d OCLCQ  |d GW5XE  |d OCLCF  |d UtOrBLW 
049 |a TXAM 
050 4 |a QA76.9.A43 
082 0 4 |a 005.1  |2 23 
100 1 |a Steier, D. M. 
245 1 0 |a Algorithm Synthesis: A Comparative Study /  |c by D.M. Steier, A.P. Anderson. 
264 1 |a New York, NY :  |b Springer US,  |c 1989. 
300 |a 1 online resource (IX, 118 pages 11 illustrations) 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
520 |a 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. 
505 0 |a Contents: Introduction -- Insertion Sort -- Quicksort -- Cartesian Set Product -- Depth-First Search -- Schorr-Waite Graph Marking -- N-Queens -- Convex Hull -- Design Space: The Final Frontier -- References -- Index. 
500 |a Electronic resource. 
650 0 |a Computer science. 
650 0 |a Software engineering. 
650 0 |a Computer software. 
650 0 |a Artificial intelligence. 
650 7 |a Artificial intelligence.  |2 fast  |0 (OCoLC)fst00817247 
650 7 |a Computer science.  |2 fast  |0 (OCoLC)fst00872451 
650 7 |a Computer software.  |2 fast  |0 (OCoLC)fst00872527 
650 7 |a Software engineering.  |2 fast  |0 (OCoLC)fst01124185 
655 7 |a Electronic books.  |2 local 
700 1 |a Anderson, A. P. 
710 2 |a SpringerLink (Online service) 
856 4 0 |u http://proxy.library.tamu.edu/login?url=https://link.springer.com/10.1007/978-1-4613-8877-7  |z Connect to the full text of this electronic book  |t 0 
994 |a 92  |b TXA 
999 |a MARS 
999 f f |s 63f7c4fb-c328-38a6-964c-b5e26f087867  |i dc528d26-7e11-3a9e-a592-5eaa1b25ccc7  |t 0 
952 f f |a Texas A&M University  |b College Station  |c Electronic Resources  |s www_evans  |d Available Online  |t 0  |e QA76.9.A43  |h Library of Congress classification 
998 f f |a QA76.9.A43  |t 0  |l Available Online