Results 1  10
of
321
Concurrent backtrack search for discsps, in
 Proc. FLAIRS04
, 2004
"... A distributed search algorithm for solving distributed constraint satisfaction problems (DisCSPs) is presented. The proposed algorithm is composed of multiple search processes (SPs) that operate concurrently. Concurrent search processes scan nonintersecting parts of the search space. Each SP is repr ..."
Abstract

Cited by 7 (4 self)
 Add to MetaCart
search processes dynamically, starting with the initializing agent, but occurring also at any number of agents during search. The Concurrent BackTracking (ConcBT) algorithm is presented and an outline of the correctness proof is given. Experimental evaluation of the algorithm, on randomly generated DisCSPs
Asynchronous Forwardchecking for DisCSPs
, 2007
"... A new search algorithm for solving distributed constraint satisfaction problems (DisCSPs) is presented. Agents assign variables sequentially, but perform forward checking asynchronously. The asynchronous forwardchecking algorithm (AFC) is a distributed search algorithm that keeps one consistent par ..."
Abstract

Cited by 21 (3 self)
 Add to MetaCart
search. Several ordering heuristics are presented. The three best heuristics are evaluated and shown to improve the performance of AFC with static order by a large factor. An experimental comparison of AFC to asynchronous backtracking (ABT) on randomly generated DisCSPs is also presented. AFC
Concurrent Backtrack Search on DisCSPs
"... A distributed search algorithm for solving distributed constraint satisfaction problems (DisCSPs) is presented. The proposed algorithm is composed of multiple search processes (SPs) that operate concurrently. Concurrent search processes scan nonintersecting parts of the search space. Each SP is repr ..."
Abstract
 Add to MetaCart
search processes dynamically, starting with the initializing agent, but occurring also at any number of agents during search. The Concurrent BackTracking (ConcBT) algorithm is presented and an outline of the correctness proof is given. Experimental evaluation of the algorithm, on randomly generated DisCSPs
Synchronous, asynchronous and hybrid algorithms for DisCSP
 IN: WORKSHOP ON DCR04, CP2004
, 2004
"... There is some debate about the kind of algorithms that are most suitable to solve DisCSP. Synchronous algorithms exchange updated information with a low degree of parallelism. Asynchronous algorithms use less updated information with a higher parallelism. Hybrid algorithms combine both features. Lat ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
of these algorithms onqueens and binary random DisCSPs.
Asynchronous backtracking for asymmetric discsps
 In Proc. 6th workshop on Distributed Constraints Reasoning, DCR05
, 2005
"... Abstract. Distributed constraint satisfaction problems (DisCSPs) with asymmetric constraints reflect the fact that agents may wish to retain their constraints private. The set of valid pairs of values of every binary constraint is split between the two constrained agents. An asynchronous backtrackin ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
backtracking algorithm for asymmetric DisCSPs is presented. The new algorithm is based on asynchronous backtracking (ABT), but, propagates assignments both to lower priority agents and to higher priority agents. The ABT ASC algorithm is evaluated experimentally on randomly generated asymmetric DisCSP s. Its
On the Evaluation of DisCSP Algorithms
 IN PROC. WORKSHOP ON DISTRIBUTED CONSTRAINT REASONING HELD AT CONSTRAINT PROGRAMMING 2004 (CP
, 2004
"... Abstract. Not every research paper in DisCSP evaluates algorithms in the same way. Motivated by this fact, we revise some elements of the area of distributed algorithms as well as distributed constraints, which can help to develop a wellfounded methodology for evaluation of DisCSP algorithms. Althou ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract. Not every research paper in DisCSP evaluates algorithms in the same way. Motivated by this fact, we revise some elements of the area of distributed algorithms as well as distributed constraints, which can help to develop a wellfounded methodology for evaluation of DisCSP algorithms
Hierarchical search on DisCSPs
, 2006
"... Two new distributed search algorithms for Distributed CSPs are proposed. In one algorithm, search is performed concurrently on disjoint parts of the global search space, by agents that constitute these parts. Agents form a hierarchy of groups and each group generates consistent partial solutions. Pa ..."
Abstract
 Add to MetaCart
Two new distributed search algorithms for Distributed CSPs are proposed. In one algorithm, search is performed concurrently on disjoint parts of the global search space, by agents that constitute these parts. Agents form a hierarchy of groups and each group generates consistent partial solutions. Partial solutions are produced concurrently and are combined into consistent global solutions by agents that are higher in the hierarchy. In another algorithm, concurrent independent backtracking search processes grow partial assignments along a hierarchy of agent groups, with each agent participating in multiple search processes. Stochastic choices for the order of assigning agents are taken after backtracking, securing the growing partial assignments from stalling in local minima. The first part of both algorithms partitions the distributed constraint network into a binary tree of groups. After completing the partition, the hierarchy of groups starts to produce partial solutions. The distributed partition algorithm uses a heuristic that selects to join neighbors that are strongly constrained, into groups. This is
Communication and Computation in DisCSP Algorithms
 In Proceedings of the Ninth International Conference on Principles and Practice of Constraint Programming (CP’02
, 2002
"... Abstract. We introduce SensorDCSP, a naturally distributed benchmark based on a realworld application that arises in the context of networked distributed systems. In order to study the performance of DisCSP algorithms in a truly distributed setting, we use a discreteevent network simulator, which ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
, random delays, in some cases combined with a dynamic decentralized restart strategy, can improve the performance of DisCSP algorithms. More interestingly, we also found that the active introduction of message delays by agents can improve performance and robustness, while reducing the overall network load
Descending Requirements Search for DisCSPs
"... Abstract. A new search algorithm, Descending Requirements Search (DESRS), for Distributed CSPs is proposed. The algorithm is composed of two independent phases. In the first phase, agents form a binary hierarchy of groups. The distributed partition algorithm uses a heuristic that prefers to join nei ..."
Abstract
 Add to MetaCart
algorithm is evaluated experimentally on randomly generated DISCSPs. Both runtime performance and network load of DESRS are better than Asynchronous Backtracking (ABT). The runtime performance of DESRS is similar to that of the best concurrent search algorithm CONCDB, on medium sized problems. 1
Parallel Backtrack Search on DisCSP
, 2002
"... A parallel algorithm for solving distributed constraint networks (DCNs) is presented. The DCNs are composed of agents, each holding a local network of constraints, where all agents are connected by constraints. The parallel backtracking algorithm (PBT) initiates multiple search processes (SPs) that ..."
Abstract

Cited by 14 (9 self)
 Add to MetaCart
A parallel algorithm for solving distributed constraint networks (DCNs) is presented. The DCNs are composed of agents, each holding a local network of constraints, where all agents are connected by constraints. The parallel backtracking algorithm (PBT) initiates multiple search processes (SPs) that operate in parallel. Parallel search processes scan different parts of the search tree, each represented by a data structure that is circulated among the different agents. The PBT algorithm...
Results 1  10
of
321