Nicoleta Neagu

Constraint Satisfaction Techniques for Agent-Based Reasoning (eBook, PDF)

• Format: PDF

Produktbeschreibung

Constraint satisfaction problems are significant in the domain of automated reasoning for artificial intelligence. They can be applied to the modeling and solving of a wide range of combinatorial applications such as planning, scheduling and resource sharing in a variety of practical domains such as transportation, production, supply-chains, network management and human resource management. In this book we study new techniques for solving constraint satisfaction problems, with a special focus on solution adaptation applied to agent reasoning.

---

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.

Produktdetails

• Verlag: Birkhäuser Basel
• Seitenzahl: 158
• Erscheinungstermin: 30. März 2006
• Englisch
• ISBN-13: 9783764373191
• Artikelnr.: 37397818

Inhaltsangabe

Interchangeability and Solution Adaptation in Crisp CSPs.- Interchangeability in Soft CSPs.- Multi Agent Computation of Interchangeability in Distributed CSPs.- Interchangeability in Dynamic Environments.- Generic Case Adaptation Framework.- Conclusions.