E Book

Constraint Satisfaction Techniques for Agent-Based Reasoning

---

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.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.

---

Ketersediaan

Tidak ada salinan data

Informasi Detail

Judul Seri

-

No. Panggil

-

Penerbit

Birkhäuser Basel : Springer., 2005

Deskripsi Fisik

XII, 158 p.online resource.

Bahasa

English

ISBN/ISSN

9783764373191

Klasifikasi

006.3

Tipe Isi

-

Tipe Media

-

Tipe Pembawa

-

Edisi

1st ed.

Subjek

Artificial intelligence.
Computer science.
Computer Science, general.

Info Detail Spesifik

-

Pernyataan Tanggungjawab

Nicoleta Neagu.

Versi lain/terkait

Lampiran Berkas

Komentar

---

Anda harus masuk sebelum memberikan komentar