ISBN: 9781558608726 - stochastic local search: foundations and applications (the morgan kaufmann series in artificial intelligence) (5 resultados)

hardcover. Condición: Very Good. Unmarked pages. Solid binding.

Condición: Very Good. : Este libro explora los algoritmos de búsqueda local estocástica para problemas combinatorios. Cubre los fundamentos y aplicaciones de la inteligencia artificial, con un enfoque en la programación estocástica y el análisis combinatorio. Ideal para aquellos interesados en la investigación de operaciones y la inteligencia artificial en general. EAN: 9781558608726 Tipo: Libros Categoría: Tecnología Título: Stochastic Local Search Autor: Holger H Hoos Idioma: eng Páginas: 658 Formato: tapa dura.…

Hardcover. Condición: New. In shrink wrap. Looks like an interesting title.

Buch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Stochastic local search (SLS) algorithms are among the most prominent and successful techniques for solving computationally difficult problems in many areas of computer science and operations research, including propositional satisfiability, constraint satisfaction, routing, and scheduling. SLS algorithms have also become increasingly popular for solving challenging combinatorial problems in many application areas, such as e-commerce and bioinformatics.Hoos and Stützle offer the first systematic and unified treatment of SLS algorithms. In this groundbreaking new book, they examine the general concepts and specific instances of SLS algorithms and carefully consider their development, analysis and application. The discussion focuses on the most successful SLS methods and explores their underlying principles, properties, and features. This book gives hands-on experience with some of the most widely used search techniques, and provides readers with the necessary understanding and skills to use this powerful tool. 658 pp. Englisch. …

Buch. Condición: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Stochastic local search (SLS) algorithms are among the most prominent and successful techniques for solving computationally difficult problems in many areas of computer science and operations research, including propositional satisfiability, constraint satisfaction, routing, and scheduling. SLS algorithms have also become increasingly popular for solving challenging combinatorial problems in many application areas, such as e-commerce and bioinformatics.Hoos and Stützle offer the first systematic and unified treatment of SLS algorithms. In this groundbreaking new book, they examine the general concepts and specific instances of SLS algorithms and carefully consider their development, analysis and application. The discussion focuses on the most successful SLS methods and explores their underlying principles, properties, and features. This book gives hands-on experience with some of the most widely used search techniques, and provides readers with the necessary understanding and skills to use this powerful tool.…