Combinatorial Search: From Algorithms to Systems

Although they are believed to be unsolvable in general, tractability results suggest that some practical NP-hard problems can be efficiently solved. Combinatorial search algorithms are designed to efficiently explore the usually large solution space of these instances by reducing the search space to...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Hamadi, Youssef (Autor)
Autor Corporativo: SpringerLink (Online service)
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2013.
Edición:1st ed. 2013.
Temas:
Artificial intelligence.
Computational intelligence.
Computer science.
Mathematical optimization.
Computer science-Mathematics.
Discrete mathematics.
Artificial Intelligence.
Computational Intelligence.
Theory of Computation.
Optimization.
Discrete Mathematics in Computer Science.
Acceso en línea:Texto Completo
Tabla de Contenidos:
  • Chap. 1 - Introduction
  • Chap. 2 - Boosting Distributed Constraint Networks
  • Chap. 3 - Parallel Tree Search for Satisfiability
  • Chap. 4 - Parallel Local Search for Satisfiability
  • Chap. 5 - Learning Variables Dependencies
  • Chap. 6 - Continuous Search
  • Chap. 7 - Autonomous Search
  • Chap. 8 - Conclusion and Perspectives.

Ejemplares similares