Algorithms and Ordering Heuristics for Distributed Constraint Satisfaction Problems:
DisCSP (Distributed Constraint Satisfaction Problem) is a general framework for solving distributed problems arising in Distributed Artificial Intelligence. A wide variety of problems in artificial intelligence are solved using the constraint satisfaction problem paradigm. However, there are several...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Somerset
John Wiley & Sons, Incorporated
2013
|
| Ausgabe: | 1st ed |
| Schriftenreihe: | FOCUS Series
|
| Schlagworte: | |
| Zusammenfassung: | DisCSP (Distributed Constraint Satisfaction Problem) is a general framework for solving distributed problems arising in Distributed Artificial Intelligence. 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. Contents Introduction Part 1. Background on Centralized and Distributed Constraint Reasoning 1. Constraint Satisfaction Problems 2. Distributed Constraint Satisfaction Problems Part 2. Synchronous Search Algorithms for DisCSPs 3. Nogood Based Asynchronous Forward Checking (AFC-ng) 4. Asynchronous Forward Checking Tree (AFC-tree) 5. Maintaining Arc Consistency Asynchronously in Synchronous Distributed Search Part 3. Asynchronous Search Algorithms and Ordering Heuristics for DisCSPs 6. Corrigendum to "Min-domain Retroactive Ordering for Asynchronous Backtracking" 7. Agile Asynchronous BackTracking (Agile-ABT) Part 4. DisChoco 2.0: A Platform for Distributed Constraint Reasoning 8. DisChoco 2.0 9. Conclusion About the Authors 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 |
| Beschreibung: | Description based on publisher supplied metadata and other sources |
| Beschreibung: | 1 online resource (154 pages) |
| ISBN: | 9781118753422 9781848215948 |
Internformat
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV044050354 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 170217s2013 |||| o||u| ||||||eng d | ||
| 020 | |a 9781118753422 |9 978-1-118-75342-2 | ||
| 020 | |a 9781848215948 |c Print |9 978-1-84821-594-8 | ||
| 035 | |a (ZDB-30-PAD)EBC1272348 | ||
| 035 | |a (ZDB-89-EBL)EBL1272348 | ||
| 035 | |a (ZDB-38-EBR)ebr10731759 | ||
| 035 | |a (OCoLC)852758626 | ||
| 035 | |a (DE-599)BVBBV044050354 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 082 | 0 | |a 005.116 | |
| 100 | 1 | |a Wahbi, Mohamed |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Algorithms and Ordering Heuristics for Distributed Constraint Satisfaction Problems |
| 250 | |a 1st ed | ||
| 264 | 1 | |a Somerset |b John Wiley & Sons, Incorporated |c 2013 | |
| 264 | 4 | |c © 2013 | |
| 300 | |a 1 online resource (154 pages) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a FOCUS Series | |
| 500 | |a Description based on publisher supplied metadata and other sources | ||
| 520 | |a DisCSP (Distributed Constraint Satisfaction Problem) is a general framework for solving distributed problems arising in Distributed Artificial Intelligence. 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. Contents Introduction Part 1. Background on Centralized and Distributed Constraint Reasoning 1. Constraint Satisfaction Problems 2. Distributed Constraint Satisfaction Problems Part 2. Synchronous Search Algorithms for DisCSPs 3. Nogood Based Asynchronous Forward Checking (AFC-ng) 4. Asynchronous Forward Checking Tree (AFC-tree) 5. Maintaining Arc Consistency Asynchronously in Synchronous Distributed Search Part 3. Asynchronous Search Algorithms and Ordering Heuristics for DisCSPs 6. Corrigendum to "Min-domain Retroactive Ordering for Asynchronous Backtracking" 7. Agile Asynchronous BackTracking (Agile-ABT) Part 4. DisChoco 2.0: A Platform for Distributed Constraint Reasoning 8. DisChoco 2.0 9. Conclusion About the Authors 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 | 4 | |a Computer algorithms | |
| 650 | 4 | |a Image processing -- Digital techniques | |
| 650 | 4 | |a Neural computers | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |a Wahbi, Mohamed |t Algorithms and Ordering Heuristics for Distributed Constraint Satisfaction Problems |
| 912 | |a ZDB-30-PAD |a ZDB-38-ESG | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-029457199 | ||
Datensatz im Suchindex
| _version_ | 1804177067761205248 |
|---|---|
| any_adam_object | |
| author | Wahbi, Mohamed |
| author_facet | Wahbi, Mohamed |
| author_role | aut |
| author_sort | Wahbi, Mohamed |
| author_variant | m w mw |
| building | Verbundindex |
| bvnumber | BV044050354 |
| collection | ZDB-30-PAD ZDB-38-ESG |
| ctrlnum | (ZDB-30-PAD)EBC1272348 (ZDB-89-EBL)EBL1272348 (ZDB-38-EBR)ebr10731759 (OCoLC)852758626 (DE-599)BVBBV044050354 |
| dewey-full | 005.116 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.116 |
| dewey-search | 005.116 |
| dewey-sort | 15.116 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| edition | 1st ed |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03286nmm a2200421zc 4500</leader><controlfield tag="001">BV044050354</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">170217s2013 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781118753422</subfield><subfield code="9">978-1-118-75342-2</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781848215948</subfield><subfield code="c">Print</subfield><subfield code="9">978-1-84821-594-8</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-30-PAD)EBC1272348</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-89-EBL)EBL1272348</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-38-EBR)ebr10731759</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)852758626</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV044050354</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.116</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Wahbi, Mohamed</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Algorithms and Ordering Heuristics for Distributed Constraint Satisfaction Problems</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1st ed</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Somerset</subfield><subfield code="b">John Wiley & Sons, Incorporated</subfield><subfield code="c">2013</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">© 2013</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (154 pages)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">FOCUS Series</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Description based on publisher supplied metadata and other sources</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">DisCSP (Distributed Constraint Satisfaction Problem) is a general framework for solving distributed problems arising in Distributed Artificial Intelligence. 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. Contents Introduction Part 1. Background on Centralized and Distributed Constraint Reasoning 1. Constraint Satisfaction Problems 2. Distributed Constraint Satisfaction Problems Part 2. Synchronous Search Algorithms for DisCSPs 3. Nogood Based Asynchronous Forward Checking (AFC-ng) 4. Asynchronous Forward Checking Tree (AFC-tree) 5. Maintaining Arc Consistency Asynchronously in Synchronous Distributed Search Part 3. Asynchronous Search Algorithms and Ordering Heuristics for DisCSPs 6. Corrigendum to "Min-domain Retroactive Ordering for Asynchronous Backtracking" 7. Agile Asynchronous BackTracking (Agile-ABT) Part 4. DisChoco 2.0: A Platform for Distributed Constraint Reasoning 8. DisChoco 2.0 9. Conclusion About the Authors 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</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Image processing -- Digital techniques</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Neural computers</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="a">Wahbi, Mohamed</subfield><subfield code="t">Algorithms and Ordering Heuristics for Distributed Constraint Satisfaction Problems</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-30-PAD</subfield><subfield code="a">ZDB-38-ESG</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-029457199</subfield></datafield></record></collection> |
| id | DE-604.BV044050354 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T07:42:11Z |
| institution | BVB |
| isbn | 9781118753422 9781848215948 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-029457199 |
| oclc_num | 852758626 |
| open_access_boolean | |
| physical | 1 online resource (154 pages) |
| psigel | ZDB-30-PAD ZDB-38-ESG |
| publishDate | 2013 |
| publishDateSearch | 2013 |
| publishDateSort | 2013 |
| publisher | John Wiley & Sons, Incorporated |
| record_format | marc |
| series2 | FOCUS Series |
| spelling | Wahbi, Mohamed Verfasser aut Algorithms and Ordering Heuristics for Distributed Constraint Satisfaction Problems 1st ed Somerset John Wiley & Sons, Incorporated 2013 © 2013 1 online resource (154 pages) txt rdacontent c rdamedia cr rdacarrier FOCUS Series Description based on publisher supplied metadata and other sources DisCSP (Distributed Constraint Satisfaction Problem) is a general framework for solving distributed problems arising in Distributed Artificial Intelligence. 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. Contents Introduction Part 1. Background on Centralized and Distributed Constraint Reasoning 1. Constraint Satisfaction Problems 2. Distributed Constraint Satisfaction Problems Part 2. Synchronous Search Algorithms for DisCSPs 3. Nogood Based Asynchronous Forward Checking (AFC-ng) 4. Asynchronous Forward Checking Tree (AFC-tree) 5. Maintaining Arc Consistency Asynchronously in Synchronous Distributed Search Part 3. Asynchronous Search Algorithms and Ordering Heuristics for DisCSPs 6. Corrigendum to "Min-domain Retroactive Ordering for Asynchronous Backtracking" 7. Agile Asynchronous BackTracking (Agile-ABT) Part 4. DisChoco 2.0: A Platform for Distributed Constraint Reasoning 8. DisChoco 2.0 9. Conclusion About the Authors 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 Computer algorithms Image processing -- Digital techniques Neural computers Erscheint auch als Druck-Ausgabe Wahbi, Mohamed Algorithms and Ordering Heuristics for Distributed Constraint Satisfaction Problems |
| spellingShingle | Wahbi, Mohamed Algorithms and Ordering Heuristics for Distributed Constraint Satisfaction Problems Computer algorithms Image processing -- Digital techniques Neural computers |
| title | Algorithms and Ordering Heuristics for Distributed Constraint Satisfaction Problems |
| title_auth | Algorithms and Ordering Heuristics for Distributed Constraint Satisfaction Problems |
| title_exact_search | Algorithms and Ordering Heuristics for Distributed Constraint Satisfaction Problems |
| title_full | Algorithms and Ordering Heuristics for Distributed Constraint Satisfaction Problems |
| title_fullStr | Algorithms and Ordering Heuristics for Distributed Constraint Satisfaction Problems |
| title_full_unstemmed | Algorithms and Ordering Heuristics for Distributed Constraint Satisfaction Problems |
| title_short | Algorithms and Ordering Heuristics for Distributed Constraint Satisfaction Problems |
| title_sort | algorithms and ordering heuristics for distributed constraint satisfaction problems |
| topic | Computer algorithms Image processing -- Digital techniques Neural computers |
| topic_facet | Computer algorithms Image processing -- Digital techniques Neural computers |
| work_keys_str_mv | AT wahbimohamed algorithmsandorderingheuristicsfordistributedconstraintsatisfactionproblems |