Neu:
82,47€82,47€
KOSTENFREIE Retouren
Kostenlose Lieferung:
Samstag, 18. Feb.
Nur noch 2 auf Lager
Versand durch: Amazon Verkauft von: Amazon
Rückgaberichtlinien: Retournierbar innerhalb von 30 Tagen nach Erhalt
Gebraucht kaufen 73,75 €

Lade die kostenlose Kindle-App herunter und lese deine Kindle-Bücher sofort auf deinem Smartphone, Tablet oder Computer – kein Kindle-Gerät erforderlich. Weitere Informationen
Mit Kindle für Web kannst du sofort in deinem Browser lesen.
Scanne den folgenden Code mit deiner Mobiltelefonkamera und lade die Kindle-App herunter.


Mehr erfahren
Dem Autor folgen
OK
Heuristic Search: Theory and Applications Gebundene Ausgabe – Illustriert, 28. Juli 2011
Preis | Neu ab | Gebraucht ab |
- Kindle
41,91 € Lies mit kostenfreien App - Gebundenes Buch
82,47 €
Erweitere deinen Einkauf
Search has been vital to artificial intelligence from the very beginning as a core technique in problem solving. The authors present a thorough overview of heuristic search with a balance of discussion between theoretical analysis and efficient implementation and application to real-world problems. Current developments in search such as pattern databases and search with efficient use of external memory and parallel processing units on main boards and graphics cards are detailed.
Heuristic search as a problem solving tool is demonstrated in applications for puzzle solving, game playing, constraint satisfaction and machine learning. While no previous familiarity with heuristic search is necessary the reader should have a basic knowledge of algorithms, data structures, and calculus. Real-world case studies and chapter ending exercises help to create a full and realized picture of how search fits into the world of artificial intelligence and the one around us.
- Seitenzahl der Print-Ausgabe712 Seiten
- SpracheEnglisch
- HerausgeberMorgan Kaufmann
- Erscheinungstermin28. Juli 2011
- Abmessungen19.05 x 4.6 x 23.5 cm
- ISBN-100123725127
- ISBN-13978-0123725127
Produktbeschreibungen
Pressestimmen
"Heuristic Search is a very solid monograph and textbook on (not only heuristic) search. In its presentation it is always more formal than colloquial, it is precise and well structured. Due to its spiral approach it motivates reading it in its entirety." --Zentralblatt MATH 2012
"The authors have done an outstanding job putting together this book on artificial intelligence (AI) heuristic state space search. It comprehensively covers the subject from its basics to the most recent work and is a great introduction for beginners in this field." --BCS.org
"Heuristic search lies at the core of Artificial Intelligence and it provides the foundations for many different approaches in problem solving. This book provides a comprehensive yet deep description of the main algorithms in the field along with a very complete discussion of their main applications. Very well-written, it embellishes every algorithm with pseudo-code and technical studies of their theoretical performance." --Carlos Linares López, Universidad Carlos III de Madrid
"This is an introduction to artificial intelligence heuristic state space search. Authors Edelkamp (U. of Bremen, Germany) and Schrödl (a research scientist at Yahoo! Labs) seek to strike a balance between search algorithms and their theoretical analysis, on the one hand, and their efficient implementation and application to important real-world problems on the other, while covering the field comprehensively from well-known basic results to recent work in the state of the art. Prior knowledge of artificial intelligence is not assumed, but basic knowledge of algorithms, data structures, and calculus is expected. Proofs are included for formal rigor and to introduce proof techniques to the reader. They have organized the material into five sections: heuristic search primer, heuristic search under memory constraints, heuristic search under time constraints, heuristic search variants, and applications." --SciTech Book News
"This almost encyclopedic text is suitable for advanced courses in artificial intelligence and as a text and reference for developers, practitioners, students, and researchers in artificial intelligence, robotics, computational biology, and the decision sciences. The exposition is comparable to texts for a graduate-level or advanced undergraduate course in computer science, and prior exposure or coursework in advanced algorithms, computability, or artificial intelligence would help a great deal in understanding the material. Algorithms are described in pseudocode, accompanied by diagrams and narrative explanations in the text. The vast size of the ‘search algorithms’ subject domain and the variety of applications of search mean that much information--especially pertaining to applications of search algorithms--had to be left out; however, an extensive (though still limited) bibliography is included for follow-up by the reader. Exercises are provided for each chapter, except the five chapters on applications, and bibliographic notes accompany all chapters." --Computing Reviews
Rezension
Buchrückseite
From the very beginning of artificial intelligence, search has been vital as a core technique in problem-solving. Heuristic Search provides a thorough overview of heuristic search with a balance of discussion between theoretical analysis and efficient implementation and application to real-world problems. Current developments in search such as pattern databases and search with efficient use of external memory and parallel processing units on main boards and graphics cards are detailed.
Search as a problem-solving tool is shown in applications for puzzle solving, game playing, constraint satisfaction and machine learning. While no previous familiarity with heuristic search is necessary, the reader should have a basic knowledge of algorithms, data structures, and calculus. Real-world case studies and chapter ending exercises are included.
The content is organized into five parts as follows:
- Heuristic Search Primer: Basic Search Algorithms, Dictionary Data Structures, Automatically Created Heuristics
- Heuristic Search under Memory Constraints: Linear-Space Search, Memory-Restricted Search, Symbolic Search, External Search
- Heuristic Search Under Time Constraints: Distributed Search, State-Space Pruning, and Real-Time Search
- Heuristic Search Variants: Adversary Search, Constraint Search, and Selective Search
- Heuristic Search Applications: Action Planning, Automated System Verification, Vehicle Navigation, Computational Biology, and Robotics
Über den Autor und weitere Mitwirkende
Stefan Schroedl is a researcher and software developer in the areas of artifical intelligence and machine learning. He worked as a freelance software developer for different companies in Germany and Switzerland, among others, designing and realizing a route finding systems for a leading commercial product in Switzerland. At DaimlerChrylser Research, he continued to work on automated generation and search of route maps based on global positioning traces. Stefan Schroedl later joined Yahoo! Labs to develop auction algorithms, relevance prediction and user personalization systems for web search advertising. In his current position at A9.com, he strives to improve Amazon.com's product search using machine-learned ranking models. He has published on route finding algorithms, memory-limited and external-memory search, as well as on search for solving DNA sequence alignment problems. Stefan Schroedl hold a Ph.D. for his dissertation "Negation as Failure in Explanation- Based Generalization", and a M.S degree for his thesis "Coupling Numerical and Symbolic Methods in the Analysis of Neurophysiological Experiments".
Produktinformation
- Herausgeber : Morgan Kaufmann; Illustrated Edition (28. Juli 2011)
- Sprache : Englisch
- Gebundene Ausgabe : 712 Seiten
- ISBN-10 : 0123725127
- ISBN-13 : 978-0123725127
- Abmessungen : 19.05 x 4.6 x 23.5 cm
- Amazon Bestseller-Rang: Nr. 2,594,408 in Bücher (Siehe Top 100 in Bücher)
- Nr. 1,154 in Objektorientiertes Softwaredesign
- Nr. 3,884 in Künstliche Intelligenz (Bücher)
- Nr. 9,660 in Strategisches Management (Bücher)
- Kundenrezensionen:
Informationen zum Autor

Entdecke mehr Bücher des Autors, sieh dir ähnliche Autoren an, lies Autorenblogs und mehr
Kundenrezensionen
Kundenbewertungen, einschließlich Produkt-Sternebewertungen, helfen Kunden, mehr über das Produkt zu erfahren und zu entscheiden, ob es das richtige Produkt für sie ist.
Um die Gesamtbewertung der Sterne und die prozentuale Aufschlüsselung nach Sternen zu berechnen, verwenden wir keinen einfachen Durchschnitt. Stattdessen berücksichtigt unser System beispielsweise, wie aktuell eine Bewertung ist und ob der Prüfer den Artikel bei Amazon gekauft hat. Es wurden auch Bewertungen analysiert, um die Vertrauenswürdigkeit zu überprüfen.
Erfahre mehr darüber, wie Kundenbewertungen bei Amazon funktionieren.Spitzenrezensionen aus anderen Ländern



Kundenrezension aus den USA 🇺🇸 am 3. Januar 2022


Different from my expectation, despite its thick volume, just a few core or important techniques prevail over this book, like BFS, DFS, A*, ..., mixing with articles on artificial or computational intelligence.
It's true that this book provides lots of things to know to understand heuristic search, but I think it needs to reduce and focus its major subjects or to change the way to explain.
Good book.