Results 1  10
of
379
The Distributed Constraint Satisfaction Problem: Formalization and Algorithms
 IEEE Transactions on Knowledge and Data Engineering
, 1998
"... In this paper, we develop a formalism called a distributed constraint satisfaction problem (distributed CSP) and algorithms for solving distributed CSPs. A distributed CSP is a constraint satisfaction problem in which variables and constraints are distributed among multiple agents. Various applica ..."
Abstract

Cited by 326 (27 self)
 Add to MetaCart
of the algorithm. Furthermore, we describe how the asynchronous backtracking algorithm can be modified into a more efficient algorithm called an asynchronous weakcommitment search, which can revise a bad decision without exhaustive search by changing the priority order of agents dynamically. The experimental
Distributed Constraint Satisfaction Algorithm for Complex Local Problems
, 1998
"... A distributed constraint satisfaction problem can formalize various application problems in MAS, and several algorithms for solving this problem have been developed. One limitation of these algorithms is that they assume each agent has only one local variable. Although simple modifications enable th ..."
Abstract

Cited by 79 (11 self)
 Add to MetaCart
these algorithms to handle multiple local variables, obtained algorithms are neither efficient nor scalable to larger problems. We develop a new algorithm that can handle multiple local variables efficiently, which is based on the asynchronous weakcommitment search algorithm. In this algorithm, a bad local
Proceedings of the 20th IEEE International Conference on Distributed Computing Systems (ICDCS2000), pp.169–177 (2000) The Effect of Nogood Learning in Distributed Constraint Satisfaction ∗
"... We present resolventbased learning as a new nogood learning method for a distributed constraint satisfaction algorithm. This method is based on a lookback technique in constraint satisfaction algorithms and can efficiently make effective nogoods. We combine the method with the asynchronous weakco ..."
Abstract
 Add to MetaCart
We present resolventbased learning as a new nogood learning method for a distributed constraint satisfaction algorithm. This method is based on a lookback technique in constraint satisfaction algorithms and can efficiently make effective nogoods. We combine the method with the asynchronous weakcommitment
Weakcommitment Search for Solving Constraint Satisfaction Problems
, 1994
"... The minconflict heuristic has been introduced into backtracking algorithms and iterative improvement algorithms as a powerful heuristic for solving constraint satisfaction problems. Backtracking algorithms become inefficient when a bad partial solution is constructed, since an exhaustive search is ..."
Abstract

Cited by 60 (5 self)
 Add to MetaCart
(e.g., forward checking) presuppose the existence of a consistent partial solution. Therefore, these heuristics can not be applied to iterative improvement algorithms. Furthermore, these algorithms are not theoretically complete. In this paper, a new algorithm called weakcommitment search which
International Conference on Principles and Practice of Constraint Programming 1995, pp.88–102 Asynchronous Weakcommitment Search for Solving Distributed Constraint Satisfaction Problems
"... Abstract. A distributed constraint satisfaction problem (Distributed CSP) is a CSP in which variables and constraints are distributed among multiple automated agents, and various application problems in Distributed Artificial Intelligence can be formalized as Distributed CSPs. We develop a new algor ..."
Abstract
 Add to MetaCart
algorithm for solving Distributed CSPs called asynchronous weakcommitment search, which is inspired by the weakcommitment search algorithm for solving CSPs. This algorithm can revise a bad decision without an exhaustive search by changing the priority order of agents dynamically. Furthermore, agents can
An algorithm for subgraph isomorphism
 JOURNAL OF THE ACM
, 1976
"... Subgraph isomorphism can be determined by means of a bruteforce treesearch enumeration procedure. In this paper a new algorithm is introduced that attains efficiency by inferentially eliminating successor nodes in the tree search. To assess the time actually taken by the new algorithm, subgraph is ..."
Abstract

Cited by 347 (1 self)
 Add to MetaCart
Subgraph isomorphism can be determined by means of a bruteforce treesearch enumeration procedure. In this paper a new algorithm is introduced that attains efficiency by inferentially eliminating successor nodes in the tree search. To assess the time actually taken by the new algorithm, subgraph
Algorithms for Distributed Constraint Satisfaction: A Review
 In CP
, 2000
"... . When multiple agents are in a shared environment, there usually exist constraints among the possible actions of these agents. A distributed constraint satisfaction problem (distributed CSP) is a problem to find a consistent combination of actions that satisfies these interagent constraints. Vario ..."
Abstract

Cited by 250 (11 self)
 Add to MetaCart
and several MAS application problems of distributed CSPs. Furthermore, we describe a series of algorithms for solving distributed CSPs, i.e., the asynchronous backtracking, the asynchronous weakcommitment search, the distributed breakout, and distributed consistency algorithms. Finally,we showtwo extensions
Generalising Asynchronous Weak Commitment Search: from Intensional to Extensional Constraint Representation
"... In this paper we present some preliminary concepts on extending Yokoo et al's distributed constraint satisfaction algorithms. Asynchronous backtracking and asynchronous weakcommitment search and all their improvements use a pure extensional constraint representation. All constraints therein ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In this paper we present some preliminary concepts on extending Yokoo et al's distributed constraint satisfaction algorithms. Asynchronous backtracking and asynchronous weakcommitment search and all their improvements use a pure extensional constraint representation. All constraints
Distributed Constraint Satisfaction for Formalizing Distributed Problem Solving
, 1992
"... Viewing cooperative distributed problem solving (CDPS) as distributed constraint satisfaction provides a useful formalism for characterizing CDPS techniques. In this paper, we describe this formalism and compare algorithms for solving distributed constraint satisfaction problems (DCSPs). In particul ..."
Abstract

Cited by 295 (23 self)
 Add to MetaCart
Viewing cooperative distributed problem solving (CDPS) as distributed constraint satisfaction provides a useful formalism for characterizing CDPS techniques. In this paper, we describe this formalism and compare algorithms for solving distributed constraint satisfaction problems (DCSPs
Asynchronous Search with Aggregations
 In Proc. of AAAI2000
, 2000
"... Many problemsolving tasks can be formalized as constraint satisfaction problems (CSPs). In a multiagent setting, information about constraints and variables may belong to different agents and be kept confidential. Existing algorithms for distributed constraint satisfaction consider mainly the ..."
Abstract

Cited by 74 (32 self)
 Add to MetaCart
the case where access to variables is restricted to certain agents, but constraints may have to be revealed. In this paper, we propose methods where constraints are private but variables can be manipulated by any agent. We describe a new search technique for distributed CSPs, called asynchronous
Results 1  10
of
379