Results 1 - 10
of
59
Min-domain retroactive ordering for asynchronous backtracking
, 2008
"... Ordering heuristics are a powerful tool in CSP search algorithms. Among the most successful ordering heuristics are heuristics which enforce a fail first strategy by using the Min-domain property (Haralick and ..."
Abstract
-
Cited by 6 (1 self)
- Add to MetaCart
Ordering heuristics are a powerful tool in CSP search algorithms. Among the most successful ordering heuristics are heuristics which enforce a fail first strategy by using the Min-domain property (Haralick and
Corrigendum to “Min-domain retroactive ordering for Asynchronous Backtracking”
, 2012
"... The asynchronous backtracking algorithm with dynamic ordering (ABT DO), proposed in [ZM06], allows changing the order of agents during distributed asynchronous complete search. In a later study [ZZA09], retroactive heuristics which allowed more flexibility in the selection of new orders were introdu ..."
Abstract
- Add to MetaCart
introduced, resulting in the ABT DO-Retro algorithm, and a relation between the success of heuristics and the min-domain property was identified. Unfortunately, the description of the time-stampping protocol used to compare orders in ABT DO-Retro in [ZZA09] is confusing and may lead to an implementation
Retroactive ordering heuristics for asynchronous backtracking on discsps
, 2006
"... Abstract. A new type of ordering heuristics for dynamic ordering asynchronous backtracking(ABT DO) on DisCSP s is presented. Agents can be moved to a position that is higher than that of the target of the backtrack (Nogood). This new type of heuristics do not follow the restrictions on the heuristic ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Abstract. A new type of ordering heuristics for dynamic ordering asynchronous backtracking(ABT DO) on DisCSP s is presented. Agents can be moved to a position that is higher than that of the target of the backtrack (Nogood). This new type of heuristics do not follow the restrictions
Framework for modeling reordering heuristics for asynchronous backtracking
"... Dynamic reordering of variables is known to be important for solving constraint satisfaction problems (CSPs). Efforts to apply this principle for improving polynomial space asynchronous backtracking (ABT) started with [1], using a solution based on synchronization points. [17] shows how to asynchron ..."
Abstract
-
Cited by 4 (3 self)
- Add to MetaCart
improvements, comparable to the results in [1]. We also report that min-domain dynamic ordering heuristics for ABTR are worse than no reordering and better than max-domain (in experiments that also use maintenance of arc consistency).
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 weak-commitment search, which can revise a bad decision without exhaustive search by changing the priority order of agents dynamically. The experimental
Diffusion restreinte ∗ The Retroactive Dynamic Ordering for Asynchronous Backtracking algorithm
"... (ABTDO). In this algorithm, when an agent assigns a value to its variable, it can reorder lower priority agents. Each agent in ABTDO holds a current order which is an ordered list of pairs. Every pair includes the ID of one of the agents and a counter. The counters attached to each agent ID in the o ..."
Abstract
- Add to MetaCart
retroactive heuristics, enable the generator of the nogood to be moved to a higher position than that of the target of the backtrack. In [Zivan et al., 2009], ties which could not have been generated in standard ABTDO, are broken using the agents indexes. In other words, when two contradictory orders have
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
). In particular, we present our newly developed technique called asynchronous backtracking that allows agents to act asynchronously and concurrently, in contrast to the traditional sequential backtracking techniques employed in constraint satisfaction problems. Our experimental results show that solving DCSPs
Dynamic Ordering for Asynchronous Backtracking on DisCSPs
, 2006
"... An algorithm that performs asynchronous backtracking on distributed CSPs, with dynamic ordering of agents is proposed, ABT DO. Agents propose reorderings of lower priority agents and send these proposals whenever they send assignment messages. Changes of ordering triggers a different computation of ..."
Abstract
-
Cited by 30 (8 self)
- Add to MetaCart
An algorithm that performs asynchronous backtracking on distributed CSPs, with dynamic ordering of agents is proposed, ABT DO. Agents propose reorderings of lower priority agents and send these proposals whenever they send assignment messages. Changes of ordering triggers a different computation
Retroactive Ordering for Dynamic Backtracking
"... Abstract. Dynamic Backtracking (DBT) is a well known algorithm for solving Constraint Satisfaction Problems. In DBT, variables are allowed to keep their assignment during backjump, if they are compatible with the set of eliminating explanations. A previous study has shown that when DBT is combined w ..."
Abstract
- Add to MetaCart
. The experimental results presented in this paper show an advantage of the new class of heuristics and algorithms over standard DBT and over CBJ. All algorithms tested were combined with forward-checking and used a Min-Domain heuristic. 1
Dynamic Ordering for Asynchronous Backtracking on DisCSPs
, 2007
"... An algorithm that performs asynchronous backtracking on distributed CSP s, with dynamic ordering of agents is proposed, ABT DO. Agents propose reorderings of lower priority agents and send these proposals whenever they send assignment messages. Changes of ordering triggers a different computation ..."
Abstract
-
Cited by 4 (1 self)
- Add to MetaCart
An algorithm that performs asynchronous backtracking on distributed CSP s, with dynamic ordering of agents is proposed, ABT DO. Agents propose reorderings of lower priority agents and send these proposals whenever they send assignment messages. Changes of ordering triggers a different computation
Results 1 - 10
of
59