earlybirdhw2015 Hier klicken mrp_family lagercrantz Cloud Drive Photos UHD TVs Learn More blogger HI_PROJECT Fire HD 6 Shop Kindle Sparpaket Autorip SummerSale
Gebraucht kaufen
EUR 36,86
+ EUR 3,00 Versandkosten
Gebraucht: Gut | Details
Verkauft von Deal DE
Zustand: Gebraucht: Gut
Kommentar: Dieses Buch ist in gutem, sauberen Zustand. Seiten und Einband sind intakt.
Möchten Sie verkaufen?
Zur Rückseite klappen Zur Vorderseite klappen
Hörprobe Wird gespielt... Angehalten   Sie hören eine Hörprobe des Audible Hörbuch-Downloads.
Mehr erfahren
Dieses Bild anzeigen

The Stanford Graphbase: A Platform for Combinatorial Computing (ACM Press) (Englisch) Gebundene Ausgabe – September 1993


Alle Formate und Ausgaben anzeigen Andere Formate und Ausgaben ausblenden
Amazon-Preis Neu ab Gebraucht ab
Gebundene Ausgabe
"Bitte wiederholen"
EUR 110,36 EUR 36,86
3 neu ab EUR 110,36 9 gebraucht ab EUR 36,86
Jeder kann Kindle Bücher lesen — selbst ohne ein Kindle-Gerät — mit der KOSTENFREIEN Kindle App für Smartphones, Tablets und Computer.



Produktinformation


Mehr über den Autor

Entdecken Sie Bücher, lesen Sie über Autoren und mehr

Produktbeschreibungen

Synopsis

The Stanford GraphBase: A Platform for Combinatorial Computing represents the first efforts of Donald E. Knuth's preparation for Volume Four of The Art of Computer Programming. The book's first goal is to use examples to demonstrate the art of literate programming. Each example provides a programmatic essay that can be read and enjoyed as readily as it can be interpreted by machines. In these essays/programs, Knuth makes new contributions to 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, 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.

He illustrates many of the most significant and most beautiful combinatorial algorithms that are presently known and provides sample programs that can lead to hours of amusement. In showing how the Stanford GraphBase can generate an almost inexhaustible 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. Features *Includes new contributions to our understanding of important algorithms and data structures *Provides a standard tool for evaluating combinatorial algorithms *Demonstrates a more readable, more practical style of programming *Challenges readers to surpass his own efficient algorithms 0201542757B04062001

Buchrückseite

The Stanford GraphBase: A Platform for Combinatorial Computing represents the first efforts of Donald E. Knuth's preparation for Volume Four of The Art of Computer Programming. The book's first goal is to use examples to demonstrate the art of literate programming. Each example provides a programmatic essay that can be read and enjoyed as readily as it can be interpreted by machines. In these essays/programs, Knuth makes new contributions to 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, 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. He illustrates many of the most significant and most beautiful combinatorial algorithms that are presently known and provides sample programs that can lead to hours of amusement. In showing how the Stanford GraphBase can generate an almost inexhaustible 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.

Features

  • Includes new contributions to our understanding of important algorithms and data structures
  • Provides a standard tool for evaluating combinatorial algorithms
  • Demonstrates a more readable, more practical style of programming
  • Challenges readers to surpass his own efficient algorithms



0201542757B04062001

Alle Produktbeschreibungen

Kundenrezensionen

Es gibt noch keine Kundenrezensionen auf Amazon.de
5 Sterne
4 Sterne
3 Sterne
2 Sterne
1 Sterne

Die hilfreichsten Kundenrezensionen auf Amazon.com (beta)

Amazon.com: 4 Rezensionen
1 von 1 Kunden fanden die folgende Rezension hilfreich
Tough, but very rewarding reading. 21. Januar 2014
Von Josh Berry - Veröffentlicht auf Amazon.com
Format: Gebundene Ausgabe Verifizierter Kauf
To say that this is a dense book would be underselling it. There are portions that definitely show age, though I do not think that detracts too heavily from what is here. Probably the largest detractor for many will be that it is effectively in C. That said, the "literate" style is a massive boon in understanding the code.

I am interested in any good contemporary takes on these ideas. Unfortunately, I do not know of any; though, this is likely from my ignorance as from their not existing.
If you're looking for a very well written book on Graphbase Analysis; buy this book! 30. April 2015
Von Mike Addison - Veröffentlicht auf Amazon.com
Format: Taschenbuch Verifizierter Kauf
This book is like Christmas morning to me! I've been looking for material on Graphbase analysis, and I discovered it from one of Dr. Knuth's web postings. I started off with Neo4j a while ago, and Network Graph Behavioristics has totally captivated my curiosity. This book is very well written, and very detailed on how to produce Graphbase analysis. It not only provides code examples but, the graphs it produces; backed by the mathematics it's derived from. It's a must have, if you're going to do any serious graph base analysis.
2 von 3 Kunden fanden die folgende Rezension hilfreich
Part of the Computer Science canon 14. Dezember 2009
Von Kurt D. Starsinic - Veröffentlicht auf Amazon.com
Format: Gebundene Ausgabe Verifizierter Kauf
This is a stellar book. It's important, clear, and fun to read. Donald Knuth at his best.
4 von 34 Kunden fanden die folgende Rezension hilfreich
Knuth's eccentricity discourages beginners 23. März 2002
Von Anthony Chua - Veröffentlicht auf Amazon.com
Format: Gebundene Ausgabe
I found that Knuth's reputation for eccenctricity gets in the way of actually getting to the meat of the book. For example, getting the programs to compile under Windows was not as straightforward as it could be (although not that difficult). Much harder was to get used to the idea of using CTANGLE and CWEB in order to get Graphbase to a state where you can actually compile it.
It does not help at all that Chapter 3 of the book is when how to install Graphbase is actually discussed. Just for these alone I have to give the book a 3 star rating. Perhaps I will change this once I have had the opportunity peruse the _real_ contents of the book.
Waren diese Rezensionen hilfreich? Wir wollen von Ihnen hören.