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 |
MARC
| LEADER | 00000nam a22000005i 4500 | ||
|---|---|---|---|
| 001 | 978-3-7643-7319-1 | ||
| 003 | DE-He213 | ||
| 005 | 20220126111634.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 100301s2005 sz | s |||| 0|eng d | ||
| 020 | |a 9783764373191 |9 978-3-7643-7319-1 | ||
| 024 | 7 | |a 10.1007/b137139 |2 doi | |
| 050 | 4 | |a Q334-342 | |
| 050 | 4 | |a TA347.A78 | |
| 072 | 7 | |a UYQ |2 bicssc | |
| 072 | 7 | |a COM004000 |2 bisacsh | |
| 072 | 7 | |a UYQ |2 thema | |
| 082 | 0 | 4 | |a 006.3 |2 23 |
| 100 | 1 | |a Neagu, Nicoleta. |e author. |4 aut |4 http://id.loc.gov/vocabulary/relators/aut | |
| 245 | 1 | 0 | |a Constraint Satisfaction Techniques for Agent-Based Reasoning |h [electronic resource] / |c by Nicoleta Neagu. |
| 250 | |a 1st ed. 2005. | ||
| 264 | 1 | |a Basel : |b Birkhäuser Basel : |b Imprint: Birkhäuser, |c 2005. | |
| 300 | |a XII, 158 p. |b online resource. | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 347 | |a text file |b PDF |2 rda | ||
| 490 | 1 | |a Whitestein Series in Software Agent Technologies and Autonomic Computing | |
| 505 | 0 | |a 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. | |
| 520 | |a 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. | ||
| 650 | 0 | |a Artificial intelligence. | |
| 650 | 0 | |a Computer science. | |
| 650 | 1 | 4 | |a Artificial Intelligence. |
| 650 | 2 | 4 | |a Computer Science. |
| 710 | 2 | |a SpringerLink (Online service) | |
| 773 | 0 | |t Springer Nature eBook | |
| 776 | 0 | 8 | |i Printed edition: |z 9783764390600 |
| 776 | 0 | 8 | |i Printed edition: |z 9783764372170 |
| 830 | 0 | |a Whitestein Series in Software Agent Technologies and Autonomic Computing | |
| 856 | 4 | 0 | |u https://doi.uam.elogim.com/10.1007/b137139 |z Texto Completo |
| 912 | |a ZDB-2-SCS | ||
| 912 | |a ZDB-2-SXCS | ||
| 950 | |a Computer Science (SpringerNature-11645) | ||
| 950 | |a Computer Science (R0) (SpringerNature-43710) | ||