Algorithms and ordering heuristics for distributed constraint satisfaction problems (Record no. 1606)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 02653nam a2200217 4500 |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20250714133839.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 250714b2013|||||||| |||| 00| 0 eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| ISBN | 9781118753521 |
| 041 ## - LANGUAGE CODE | |
| Language code of text/sound track or separate title | English |
| 082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Classification number | 004.65 |
| 100 ## - MAIN ENTRY--AUTHOR NAME | |
| Personal name | Wahbi, Mohamed |
| Relator term | Author |
| 245 ## - TITLE STATEMENT | |
| Title | Algorithms and ordering heuristics for distributed constraint satisfaction problems |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) | |
| Place of publication | New Jersey: |
| Name of publisher | Wiley Data and Cybersecurity, |
| Year of publication | 2013. |
| 300 ## - PHYSICAL DESCRIPTION | |
| Number of Pages | xiii, 157p. |
| 500 ## - GENERAL NOTE | |
| General note | DisCSP (Distributed Constraint Satisfaction Problem) is a general framework for solving distributed problems arising in Distributed Artificial Intelligence.<br/>A wide variety of problems in artificial intelligence are solved using the constraint satisfaction problem paradigm. However, there are several applications in multi-agent coordination that are of a distributed nature. In this type of application, the knowledge about the problem, that is, variables and constraints, may be logically or geographically distributed among physical distributed agents. This distribution is mainly due to privacy and/or security requirements. Therefore, a distributed model allowing a decentralized solving process is more adequate to model and solve such kinds of problem. The distributed constraint satisfaction problem has such properties.<br/>Contents<br/><br/>Introduction<br/>Part 1. Background on Centralized and Distributed Constraint Reasoning<br/>1. Constraint Satisfaction Problems<br/>2. Distributed Constraint Satisfaction Problems<br/>Part 2. Synchronous Search Algorithms for DisCSPs<br/>3. Nogood Based Asynchronous Forward Checking (AFC-ng)<br/>4. Asynchronous Forward Checking Tree (AFC-tree)<br/>5. Maintaining Arc Consistency Asynchronously in Synchronous Distributed Search<br/>Part 3. Asynchronous Search Algorithms and Ordering Heuristics for DisCSPs<br/>6. Corrigendum to “Min-domain Retroactive Ordering for Asynchronous Backtracking”<br/>7. Agile Asynchronous BackTracking (Agile-ABT)<br/>Part 4. DisChoco 2.0: A Platform for Distributed Constraint Reasoning<br/>8. DisChoco 2.0<br/>9. Conclusion<br/><br/>About the Authors<br/><br/>Mohamed Wahbi is currently an associate lecturer at Ecole des Mines de Nantes in France. He received his PhD degree in Computer Science from University Montpellier 2, France and Mohammed V University-Agdal, Morocco in 2012 and his research focused on Distributed Constraint Reasoning. |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical Term | Asynchronous Forward‐Checking Tree (AFC‐tree) |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical Term | Nogood‐based Asynchronous Forward Checking (AFC‐ng) |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical Term | Agile Asynchronous Backtracking (Agile‐ABT) |
| 856 ## - ELECTRONIC LOCATION AND ACCESS | |
| Uniform Resource Identifier | https://ieeexplore.ieee.org/servlet/opac?bknumber=9820785 |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | e-Books |
| Withdrawn status | Lost status | Damaged status | Not for loan | Permanent Location | Current Location | Shelving location | Full call number | Accession Number | Koha item type |
|---|---|---|---|---|---|---|---|---|---|
| Dr. S. R. Ranganathan Library | Dr. S. R. Ranganathan Library | Ebook (Online Access) | 004.65 (Online Access) | EB0034 | e-Books |