Chargement en cours…
Constraint Satisfaction Techniques for Agent-Based Reasoning
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...
| Cote: | Libro Electrónico |
|---|---|
| Auteur principal: | |
| Collectivité auteur: | |
| Format: | Électronique eBook |
| Langue: | Inglés |
| Publié: |
Basel :
Birkhäuser Basel : Imprint: Birkhäuser,
2005.
|
| Édition: | 1st ed. 2005. |
| Collection: | Whitestein Series in Software Agent Technologies and Autonomic Computing
|
| Sujets: | |
| Accès en ligne: | Texto Completo |