Matches in Harvard for { <http://id.lib.harvard.edu/aleph/008956625/catalog> ?p ?o. }
Showing items 1 to 27 of
27
with 100 items per page.
- catalog abstract "The Stanford GraphBase: A Platform for Combinatorial Computing represents the first fruits of Donald E. Knuth's preparation for Volume 4 of The Art of Computer Programming. The book's first goal is to demonstrate, through about 30 examples, the art of literate programming. Each example is a programmatic essay, a short story that can be read and enjoyed by human beings as readily as it can be read and interpreted by machines. In these essays/programs, Knuth makes new contributions to the exposition of several important algorithms and data structures, so the programs are of special interest for their content as well as for their style. The book's second goal is to provide a useful means for comparing combinatorial algorithms and for evaluating methods of combinatorial computing. To this end, Knuth's programs offer standard freely available sets of data - the Stanford GraphBase - that may be used as benchmarks to test competing methods. The data sets are both interesting in themselves and applicable to a wide variety of problem domains. With objective tests here made possible, Knuth hopes to bridge the gap between theoretical computer scientists and programmers' who have real problems to solve. As with all of Knuth's writings, this book is appreciated not only for the author's unmatched insight, but also for the fun and the challenge of his work, in which he invites us to participate. He illustrates many of the most significant and most beautiful combinatorial algorithms that are presently known and provides demonstration programs that can lead to hours of amusement. In showing how the Stanford GraphBase can generate an almost exhaustible supply of challenging problems, some of which may lead to the discovery of new and improved algorithms, Knuth proposes friendly competitions. His own initial entries into such competitions are included in the book, and readers are challenged to do better.".
- catalog contributor b12581968.
- catalog created "c1993.".
- catalog date "1993".
- catalog date "c1993.".
- catalog dateCopyrighted "c1993.".
- catalog description "Includes bibliographical references (p. [568]-569) and indexes.".
- catalog description "Technicalities -- Installation and use -- How to read CWEB programs -- Programs of the Stanford GraphBase -- Appendix A. Error codes -- Appendix B. Summary of function calls -- Appendix C. Example graph parameters -- Appendix D. 3000 five-letter words.".
- catalog description "The Stanford GraphBase: A Platform for Combinatorial Computing represents the first fruits of Donald E. Knuth's preparation for Volume 4 of The Art of Computer Programming. The book's first goal is to demonstrate, through about 30 examples, the art of literate programming. Each example is a programmatic essay, a short story that can be read and enjoyed by human beings as readily as it can be read and interpreted by machines. In these essays/programs, Knuth makes new contributions to the exposition of several important algorithms and data structures, so the programs are of special interest for their content as well as for their style. The book's second goal is to provide a useful means for comparing combinatorial algorithms and for evaluating methods of combinatorial computing. To this end, Knuth's programs offer standard freely available sets of data - the Stanford GraphBase - that may be used as benchmarks to test competing methods. The data sets are both interesting in themselves and applicable to a wide variety of problem domains. With objective tests here made possible, Knuth hopes to bridge the gap between theoretical computer scientists and programmers' who have real problems to solve. As with all of Knuth's writings, this book is appreciated not only for the author's unmatched insight, but also for the fun and the challenge of his work, in which he invites us to participate. He illustrates many of the most significant and most beautiful combinatorial algorithms that are presently known and provides demonstration programs that can lead to hours of amusement. In showing how the Stanford GraphBase can generate an almost exhaustible supply of challenging problems, some of which may lead to the discovery of new and improved algorithms, Knuth proposes friendly competitions. His own initial entries into such competitions are included in the book, and readers are challenged to do better.".
- catalog extent "vii, 576 p. :".
- catalog hasFormat "Stanford GraphBase.".
- catalog identifier "0201542757".
- catalog isFormatOf "Stanford GraphBase.".
- catalog issued "1993".
- catalog issued "c1993.".
- catalog language "eng".
- catalog publisher "New York, N.Y. : ACM Press ; Reading, Mass. : Addison-Wesley,".
- catalog relation "Stanford GraphBase.".
- catalog subject "511/.5/02853 20".
- catalog subject "Algoritmos E Estruturas De Dados larpcal".
- catalog subject "Combinatorial analysis Data processing.".
- catalog subject "QA164 .K6 1993".
- catalog subject "Stanford GraphBase.".
- catalog subject "Teoria Dos Grafos larpcal".
- catalog tableOfContents "Technicalities -- Installation and use -- How to read CWEB programs -- Programs of the Stanford GraphBase -- Appendix A. Error codes -- Appendix B. Summary of function calls -- Appendix C. Example graph parameters -- Appendix D. 3000 five-letter words.".
- catalog title "The Stanford GraphBase : a platform for combinatorial computing / Donald E. Knuth.".
- catalog type "text".