Constraint Satisfaction Techniques for Agent-Based Reasoning - Nicoleta Neagu
-20% with code BOOKS
Shipping in 12-18 days
30-day return policy
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 ... Full description
You May Also Like
Description
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.
More Information
| Author | Nicoleta Neagu |
|---|---|
| Publisher | Birkhäuser Basel |
| Series | Whitestein Series in Software Agent Technologies and Autonomic Computing |
| Release year | 2005 |
| Cover type | Softcover |
| EAN | 9783764372170 |