Nicoleta Neagu

Constraint Satisfaction Techniques for Agent-Based Reasoning

• Broschiertes Buch

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.

Produktdetails

• Whitestein Series in Software Agent Technologies and Autonomic Computing
• Verlag: Birkhäuser / Birkhäuser Basel / Springer, Basel
• Artikelnr. des Verlages: 11356479, 978-3-7643-7217-0
• 2005
• Seitenzahl: 174
• Erscheinungstermin: 28. Januar 2005
• Englisch
• Abmessung: 233mm x 155mm x 10mm
• Gewicht: 352g
• ISBN-13: 9783764372170
• ISBN-10: 3764372176
• Artikelnr.: 13733872

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.