Constraint Satisfaction Techniques for Agent-Based Reasoning - Nicoleta Neagu
-40% ar kodu BOOKS
Piegāde 12-18 darba dienu laikā
30 dienu atgriešanas 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 ... Pilns apraksts
Jums varētu patikt arī
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.
Vairāk informācijas
| Autors | Nicoleta Neagu |
|---|---|
| Izdevējs | Birkhäuser Basel |
| Series | Whitestein Series in Software Agent Technologies and Autonomic Computing |
| Izlaides gads | 2005 |
| Vāka tips | Mīkstais vāks |
| EAN | 9783764372170 |