Constraint Satisfaction Techniques for Agent-Based Reasoning - Nicoleta Neagu
-35% su kodu BOOKS
Pristatymas per 12-18 d.d.
30 dienų grąžinimo politika
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 ... Visas aprašymas
Jums taip pat gali patikti
Aprašymas
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.
Daugiau informacijos
| Autorius | Nicoleta Neagu |
|---|---|
| Leidėjas | Birkhäuser Basel |
| Series | Whitestein Series in Software Agent Technologies and Autonomic Computing |
| Išleidimo metai | 2005 |
| Viršelio tipas | Minkšti viršeliai |
| EAN | 9783764372170 |