by Steven M. LaValle
Publisher: Cambridge University Press 2006
Number of pages: 842
Planning algorithms are impacting technical disciplines and industries around the world, including robotics, computer-aided design, manufacturing, computer graphics, aerospace applications, drug design, and protein folding. Written for computer scientists and engineers with interests in artificial intelligence, robotics, or control theory, this is the only book on this topic that tightly integrates a vast body of literature from several fields into a coherent source for teaching and reference in a wide variety of applications. Difficult mathematical material is explained through hundreds of examples and illustrations.
Home page url
Download or read it online for free here:
by Clifford A. Shaffer - Dover Publications
A comprehensive treatment focusing on efficient data structures and algorithms, this text explains how to select or design the data structure best suited to specific problems. It uses C++ programming language and is suitable for second-year courses.
by Silvano Martello, Paolo Toth - John Wiley & Sons
The book on exact and approximate algorithms for a number of important problems in the field of integer linear programming, which the authors refer to as 'knapsack'. Includes knapsack problems such as binary, bounded, unbounded or binary multiple.
by Witold Bednorz - InTech
Each chapter comprises a separate study on some optimization problem giving both an introductory look into the theory the problem comes from and some new developments invented by authors. Usually some elementary knowledge is assumed.
by Chris Okasaki - Carnegie Mellon University
This book describes data structures from the point of view of functional languages. The author includes both classical data structures, such as red-black trees, and a host of new data structures developed exclusively for functional languages.