Results 1  10
of
4,914
Reducing Redundant Messages in the Asynchronous Backtracking Algorithm
"... Abstract. We show how the Asynchronous Backtracking Algorithm, a well known distributed constraint satisfaction algorithm, produces unnecessary messages. Our new optimized algorithm reduces the number of messages by implementing message management mechanism. Tests show our algorithm significantly re ..."
Abstract
 Add to MetaCart
Abstract. We show how the Asynchronous Backtracking Algorithm, a well known distributed constraint satisfaction algorithm, produces unnecessary messages. Our new optimized algorithm reduces the number of messages by implementing message management mechanism. Tests show our algorithm significantly
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
(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
Journal of Experimental and Theoretical Artificial Intelligence, to appear. The Message Management Asynchronous Backtracking Algorithm
, 2006
"... Abstract: This paper shows how the Asynchronous Backtracking (Yokoo et al., 1998) algorithm, a well known distributed constraint satisfaction algorithm, produces unnecessary messages and introduces our optimized algorithm, Message Management Asynchronous Backtracking, which reduces the number of mes ..."
Abstract
 Add to MetaCart
Abstract: This paper shows how the Asynchronous Backtracking (Yokoo et al., 1998) algorithm, a well known distributed constraint satisfaction algorithm, produces unnecessary messages and introduces our optimized algorithm, Message Management Asynchronous Backtracking, which reduces the number
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
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
GSAT and Dynamic Backtracking
 Journal of Artificial Intelligence Research
, 1994
"... There has been substantial recent interest in two new families of search techniques. One family consists of nonsystematic methods such as gsat; the other contains systematic approaches that use a polynomial amount of justification information to prune the search space. This paper introduces a new te ..."
Abstract

Cited by 386 (15 self)
 Add to MetaCart
technique that combines these two approaches. The algorithm allows substantial freedom of movement in the search space but enough information is retained to ensure the systematicity of the resulting analysis. Bounds are given for the size of the justification database and conditions are presented
Depth first search and linear graph algorithms
 SIAM JOURNAL ON COMPUTING
, 1972
"... The value of depthfirst search or "backtracking" as a technique for solving problems is illustrated by two examples. An improved version of an algorithm for finding the strongly connected components of a directed graph and ar algorithm for finding the biconnected components of an undirect ..."
Abstract

Cited by 1406 (19 self)
 Add to MetaCart
The value of depthfirst search or "backtracking" as a technique for solving problems is illustrated by two examples. An improved version of an algorithm for finding the strongly connected components of a directed graph and ar algorithm for finding the biconnected components
Optimization Flow Control, I: Basic Algorithm and Convergence
 IEEE/ACM TRANSACTIONS ON NETWORKING
, 1999
"... We propose an optimization approach to flow control where the objective is to maximize the aggregate source utility over their transmission rates. We view network links and sources as processors of a distributed computation system to solve the dual problem using gradient projection algorithm. In thi ..."
Abstract

Cited by 694 (64 self)
 Add to MetaCart
at different times and with different frequencies. We provide asynchronous distributed algorithms and prove their convergence in a static environment. We present measurements obtained from a preliminary prototype to illustrate the convergence of the algorithm in a slowly timevarying environment.
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
Adaptive Constraint Satisfaction
 WORKSHOP OF THE UK PLANNING AND SCHEDULING
, 1996
"... Many different approaches have been applied to constraint satisfaction. These range from complete backtracking algorithms to sophisticated distributed configurations. However, most research effort in the field of constraint satisfaction algorithms has concentrated on the use of a single algorithm fo ..."
Abstract

Cited by 952 (43 self)
 Add to MetaCart
Many different approaches have been applied to constraint satisfaction. These range from complete backtracking algorithms to sophisticated distributed configurations. However, most research effort in the field of constraint satisfaction algorithms has concentrated on the use of a single algorithm
Results 1  10
of
4,914