Cargando…
Constraint Satisfaction Problems : CSP Formalisms and Techniques.
Owing to their omnipresence in academia, industry, and even real life, constraint satisfaction problems (CSP) have become a subject of intense research in both artificial intelligence and operations research. This book introduces readers to the classic CSP, detailing several extensions/improvements...
| Clasificación: | Libro Electrónico |
|---|---|
| Autor principal: | |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
London :
Wiley,
2013.
|
| Colección: | ISTE.
|
| Temas: | |
| Acceso en línea: | Texto completo |
MARC
| LEADER | 00000cam a2200000Mi 4500 | ||
|---|---|---|---|
| 001 | EBOOKCENTRAL_ocn828299042 | ||
| 003 | OCoLC | ||
| 005 | 20240329122006.0 | ||
| 006 | m o d | ||
| 007 | cr |n||||||||| | ||
| 008 | 130223s2013 enk ob 001 0 eng d | ||
| 040 | |a EBLCP |b eng |e pn |c EBLCP |d YDXCP |d CDX |d OCLCO |d N$T |d OCLCQ |d OCLCO |d DEBSZ |d UKDOC |d OCLCQ |d OCLCF |d CDN |d OCLCQ |d COO |d OCLCQ |d MERUC |d OCLCQ |d ZCU |d U3W |d STF |d ICG |d INT |d OCLCQ |d TKN |d OCLCQ |d DKC |d OCLCQ |d OCLCO |d OCLCQ |d OCLCO |d OCLCL | ||
| 019 | |a 828921984 |a 896967155 | ||
| 020 | |a 9781118575017 | ||
| 020 | |a 1118575016 | ||
| 020 | |a 9781118574577 |q (electronic bk.) | ||
| 020 | |a 1118574575 |q (electronic bk.) | ||
| 020 | |a 9781299186613 |q (MyiLibrary) | ||
| 020 | |a 1299186610 |q (MyiLibrary) | ||
| 020 | |z 9781848214606 | ||
| 020 | |z 184821460X | ||
| 029 | 1 | |a AU@ |b 000055873646 | |
| 029 | 1 | |a DEBBG |b BV044050035 | |
| 029 | 1 | |a DEBSZ |b 397479492 | |
| 029 | 1 | |a DEBSZ |b 449346625 | |
| 035 | |a (OCoLC)828299042 |z (OCoLC)828921984 |z (OCoLC)896967155 | ||
| 037 | |a 449911 |b MIL | ||
| 050 | 4 | |a QA267 .G384 2013 | |
| 072 | 7 | |a MAT |x 016000 |2 bisacsh | |
| 072 | 7 | |a MAT |x 018000 |2 bisacsh | |
| 082 | 0 | 4 | |a 511.3 |
| 049 | |a UAMI | ||
| 100 | 1 | |a Ghedira, Khaled. | |
| 245 | 1 | 0 | |a Constraint Satisfaction Problems : |b CSP Formalisms and Techniques. |
| 260 | |a London : |b Wiley, |c 2013. | ||
| 300 | |a 1 online resource (240 pages). | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 490 | 1 | |a ISTE | |
| 505 | 0 | |a Blank Page; Title Page; Contents; Preface; Introduction; Chapter 1. Foundations of CSP; 1.1. Basic concepts DEFINITION; 1.2. CSP framework; 1.2.1. Formalism; 1.2.2. Areas of application; 1.2.3. Extensions; 1.3. Bibliography; Chapter 2. Consistency Reinforcement Techniques; 2.1. Basic notions; 2.1.1. Equivalence; 2.1.2. K-consistency; 2.2. Arc consistency reinforcement algorithms; 2.2.1. AC-1; 2.2.2. AC-2; 2.2.3. AC-3; 2.2.4. AC-4; 2.2.5. AC-5; 2.2.6. AC-6; 2.2.7. AC-7; 2.2.8. AC2000; 2.2.9. AC2001; 2.3. Bibliography; Chapter 3. CSP Solving Algorithms; 3.1. Complete resolution methods. | |
| 505 | 8 | |a 3.1.1. The backtracking algorithm3.1.2. Look-back algorithms; 3.1.3. Look-ahead algorithms; 3.2. Experimental validation; 3.2.1. Random generation of problems; 3.2.2. Phase transition; 3.3. Bibliography; Chapter 4. Search Heuristics; 4.1. Organization of the search space; 4.1.1. Parallel approaches; 4.1.2. Distributed approaches; 4.1.3. Collaborative approaches; 4.2. Ordering heuristics; 4.2.1. Illustrative example; 4.2.2. Variable ordering; 4.2.3. Value ordering; 4.2.4. Constraints-based ordering; 4.3. Bibliography; Chapter 5. Learning Techniques; 5.1. The "nogood" concept. | |
| 505 | 8 | |a 5.1.1. Example of union and projection5.1.2. Use of nogoods; 5.1.3. Nogood handling; 5.2. Nogood-recording algorithm; 5.3. The nogood-recording-forward-checking algorithm; 5.4. The weak-commitment-nogood-recording algorithm; 5.5. Bibliography; Chapter 6. Maximal Constraint Satisfaction Problems; 6.1. Branch and bound algorithm; 6.2. Partial Forward-Checking algorithm; 6.3. Weak-commitment search; 6.4. GENET method; 6.5. Distributed simulated annealing; 6.6. Distributed and guided genetic algorithm; 6.6.1. Basic principles; 6.6.2. The multi-agent model; 6.6.3. Genetic process. | |
| 505 | 8 | |a 6.6.4. Extensions6.7. Bibliography; Chapter 7. Constraint Satisfaction and Optimization Problems; 7.1. Formalism; 7.2. Resolution methods; 7.2.1. Branch-and-bound algorithm; 7.2.2. Tunneling algorithm; 7.3. Bibliography; Chapter 8. Distributed Constraint Satisfaction Problems; 8.1. DisCSP framework; 8.1.1. Formalism; 8.1.2. Distribution modes; 8.1.3. Communication models; 8.1.4. Convergence properties; 8.2. Distributed consistency reinforcement; 8.2.1. The DisAC-4 algorithm; 8.2.2. The DisAC-6 algorithm; 8.2.3. The DisAC-9 algorithm; 8.2.4. The DRAC algorithm; 8.3. Distributed resolution. | |
| 505 | 8 | |a 8.3.1. Asynchronous backtracking algorithm8.3.2. Asynchronous weak-commitment search; 8.3.3. Asynchronous aggregation search; 8.3.4. Approaches based on canonical distribution; 8.3.5. DOC approach; 8.3.6. Generalization of DisCSP algorithms to several variables; 8.4. Bibliography; Index; Blank Page. | |
| 520 | |a Owing to their omnipresence in academia, industry, and even real life, constraint satisfaction problems (CSP) have become a subject of intense research in both artificial intelligence and operations research. This book introduces readers to the classic CSP, detailing several extensions/improvements of both formalisms and techniques for tackling a wide variety of problems. Consistency as well as flexible, dynamic, distributed, and learning aspects are thoroughly examined and illustrated with straightforward examples. This is an excellent guide for engineers and a valuable reference for research. | ||
| 588 | 0 | |a Print version record. | |
| 504 | |a Includes bibliographical references and index. | ||
| 590 | |a ProQuest Ebook Central |b Ebook Central Academic Complete | ||
| 650 | 0 | |a Computational complexity. | |
| 650 | 0 | |a Constraints (Artificial intelligence) | |
| 650 | 6 | |a Complexité de calcul (Informatique) | |
| 650 | 6 | |a Contraintes (Intelligence artificielle) | |
| 650 | 7 | |a MATHEMATICS |x Infinity. |2 bisacsh | |
| 650 | 7 | |a MATHEMATICS |x Logic. |2 bisacsh | |
| 650 | 7 | |a Computational complexity |2 fast | |
| 650 | 7 | |a Constraints (Artificial intelligence) |2 fast | |
| 758 | |i has work: |a Constraint Satisfaction Problems [electronic resource] (Text) |1 https://id.oclc.org/worldcat/entity/E39PD3TvghMxCCMrVjFQ4jjCFC |4 https://id.oclc.org/worldcat/ontology/hasWork | ||
| 776 | 0 | 8 | |i Print version: |a Ghedira, Khaled. |t Constraint Satisfaction Problems : CSP Formalisms and Techniques. |d London : Wiley, ©2013 |z 9781848214606 |
| 830 | 0 | |a ISTE. | |
| 856 | 4 | 0 | |u https://ebookcentral.uam.elogim.com/lib/uam-ebooks/detail.action?docID=1124005 |z Texto completo |
| 938 | |a 123Library |b 123L |n 64216 | ||
| 938 | |a Coutts Information Services |b COUT |n 24806940 |c 56.95 GBP | ||
| 938 | |a EBL - Ebook Library |b EBLB |n EBL1124005 | ||
| 938 | |a EBSCOhost |b EBSC |n 536000 | ||
| 938 | |a YBP Library Services |b YANK |n 10196193 | ||
| 994 | |a 92 |b IZTAP | ||