Algorithms and Ordering Heuristics for Distributed Constraint Satisfaction Problems

Inbunden, Engelska, 2013

2 589 kr

Beställningsvara. Skickas inom 11-20 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

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.

Produktinformation

Utgivningsdatum2013-06-25
Mått163 x 241 x 20 mm
Vikt447 g
FormatInbunden
SpråkEngelska
Antal sidor176
FörlagISTE Ltd and John Wiley & Sons Inc
ISBN9781848215948

Tillhör följande kategorier

Systemvetenskap och AI inom Data och IT

PREFACE ixINTRODUCTION xiiiPART 1. BACKGROUND ON CENTRALIZED AND DISTRIBUTED CONSTRAINT REASONING 1CHAPTER 1. CONSTRAINT SATISFACTION PROBLEMS 31.1. Centralized constraint satisfaction problems 31.3. Summary 28CHAPTER 2. DISTRIBUTED CONSTRAINT SATISFACTION PROBLEMS 292.1. Distributed constraint satisfaction problems 292.2. Methods for solving DisCSPs 362.3. Summary 47PART 2. SYNCHRONOUS SEARCH ALGORITHMS FOR DISCSPS 49CHAPTER 3. NOGOOD-BASED ASYNCHRONOUS FORWARD CHECKING (AFC-NG) 513.1. Introduction 513.2. Nogood-based asynchronous forward checking 533.3. Correctness proofs 593.4. Experimental evaluation 603.5. Summary 68CHAPTER 4. ASYNCHRONOUS FORWARD-CHECKING TREE (AFC-TREE) 694.1. Introduction 694.2. Pseudo-tree ordering 704.3. Distributed depth-first search tree construction 724.4. The AFC-tree algorithm 754.5. Correctness proofs 794.6. Experimental evaluation 794.7. Other related works 854.8. Summary 86CHAPTER 5. MAINTAINING ARC CONSISTENCY ASYNCHRONOUSLY IN SYNCHRONOUS DISTRIBUTED SEARCH 875.1. Introduction 875.2. Maintaining arc consistency 885.3. Maintaining arc consistency asynchronously 895.4. Theoretical analysis 945.5. Experimental results 955.6. Summary 99PART 3. ASYNCHRONOUS SEARCH ALGORITHMS AND ORDERING HEURISTICS FOR DISCSPS 101CHAPTER 6. CORRIGENDUM TO “MIN-DOMAIN RETROACTIVE ORDERING FOR ASYNCHRONOUSBACKTRACKING” 1036.1. Introduction 1036.2. Background 1046.3. ABT_DO-Retro may not terminate 1066.4. The right way to compare orders 1086.5. Summary 110CHAPTER 7. AGILE ASYNCHRONOUS BACKTRACKING (AGILE-ABT) 1117.1. Introduction 1117.2. Introductory material 1137.3. The algorithm 1177.4. Correctness and complexity 1207.5. Experimental results 1237.6. Related works 1297.7. Summary 130PART 4. DISCHOCO 2.0: A PLATFORM FOR DISTRIBUTED CONSTRAINT REASONING 131CHAPTER 8. DISCHOCO 2.0 1338.1. Introduction 1338.2. Architecture 1348.3. Using DisChoco 2.0 1378.4. Experimentations 1408.5. Conclusion 142CONCLUSIONS 143BIBLIOGRAPHY 147INDEX 157

Mer från samma författare

Service-Oriented Computing – ICSOC 2025 Workshops

Sami Yangui, Jianwen Su, Xiao Xue, Boualem Benatallah, Zhongjie Wang, Hai Dong, Mingyi Liu, Hailiang Zhao, José María García, Jose Antonio Parejo Maestre, Victor Casamayor Pujol, Jose Garcia-Alonso, Johanna Barzen, Schahram Dustdar, Frank Leymann, Tao Yue, Sheng Cao, Guanjie Cheng, Peng He, Yangyang Wu, Yifan Zhu, Mohamed Karim Guennoun, Said Tazi, Amin Beheshti, Hamid Motahari, Mohamed Wahbi, Nasreddine Cheniki, Abderrahmane Maaradji, Yacine Sam, Sabrina Senatore, Yanmei Zhang, Ismael Bouassida Rodriguez, Slim Kallel, Nesrine Khabou