Atnaujintas knygų su minimaliais defektais pasiūlymas! Naršykite ČIA >>
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.
Autorius: | Nicoleta Neagu |
Serija: | Whitestein Series in Software Agent Technologies and Autonomic Computing |
Leidėjas: | Birkhäuser Basel |
Išleidimo metai: | 2005 |
Knygos puslapių skaičius: | 174 |
ISBN-10: | 3764372176 |
ISBN-13: | 9783764372170 |
Formatas: | 233 x 155 x 10 mm. Knyga minkštu viršeliu |
Kalba: | Anglų |
Parašykite atsiliepimą apie „Constraint Satisfaction Techniques for Agent-Based Reasoning“