Cargando…
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...
| Clasificación: | Libro Electrónico |
|---|---|
| Autor principal: | |
| Autor Corporativo: | |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Basel :
Birkhäuser Basel : Imprint: Birkhäuser,
2005.
|
| Edición: | 1st ed. 2005. |
| Colección: | Whitestein Series in Software Agent Technologies and Autonomic Computing
|
| Temas: | |
| Acceso en línea: | Texto Completo |
Tabla de Contenidos:
- Interchangeability and Solution Adaptation in Crisp CSPs
- Interchangeability in Soft CSPs
- Multi Agent Computation of Interchangeability in Distributed CSPs
- Interchangeability in Dynamic Environments
- Generic Case Adaptation Framework
- Conclusions.