Algorithms and Ordering Heuristics for Distributed Constraint Satisfaction Problems

Algorithms and Ordering Heuristics for D

📁 Algorithms and Ordering Heuristics for Distributed Constraint Satisfaction Problems

✍ Mohamed Wahbi 📂 Library 📅 2013 🏛 Wiley-ISTE 🌐 English

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

Constraint Satisfaction Problems

📁 Constraint Satisfaction Problems

📂 Library 📅 2013 🏛 Wiley-ISTE 🌐 English

A Constraint Satisfaction Problem (CSP) consists of a set of variables, a domain of values for each variable and a set of constraints. The objective is to assign a value for each variable such that all constraints are satisfied. CSPs continue to receive increased attention because of both their h

A Class of Algorithms for Distributed Co

📁 A Class of Algorithms for Distributed Constraint Optimization

✍ A. Petcu 📂 Library 📅 2009 🏛 IOS Press 🌐 English

Multi Agent Systems (MAS) have recently attracted a lot of interest because of their ability to model many real life scenarios where information and control are distributed among a set of different agents. Practical applications include planning, scheduling, distributed control, resource allocation

A Class of Algorithms for Distributed Co

📁 A Class of Algorithms for Distributed Constraint Optimization

✍ A. Petcu 📂 Library 📅 2009 🏛 IOS Press 🌐 English

Multi Agent Systems (MAS) have recently attracted a lot of interest because of their ability to model many real life scenarios where information and control are distributed among a set of different agents. Practical applications include planning, scheduling, distributed control, resource allocation

A Class of Algorithms for Distributed Co

📁 A Class of Algorithms for Distributed Constraint Optimization

✍ Adrian Petcu 📂 Library 📅 2009 🏛 IOS Press 🌐 English

The Complexity of Valued Constraint Sati

📁 The Complexity of Valued Constraint Satisfaction Problems

✍ Stanislav Živný (auth.) 📂 Library 📅 2012 🏛 Springer-Verlag Berlin Heidelberg 🌐 English

The topic of this book is the following optimisation problem: given a set of discrete variables and a set of functions, each depending on a subset of the variables, minimise the sum of the functions over all variables. This fundamental research problem has been studied within several different