Sciweavers

5831 search results - page 6 / 1167
» Distributed Dynamic Backtracking
Sort
View
CP
1995
Springer
15 years 5 months ago
Asynchronous Weak-commitment Search for Solving Distributed Constraint Satisfaction Problems
A distributed constraint satisfaction problem (Distributed CSP) is a CSP in which variables and constraints are distributed among multiple automated agents, and various application...
Makoto Yokoo
CONCUR
2008
Springer
15 years 3 months ago
Dynamic Partial Order Reduction Using Probe Sets
We present an algorithm for partial order reduction in the context of a countable universe of deterministic actions, of which finitely many are enabled at any given state. This mea...
Harmen Kastenberg, Arend Rensink
CONCUR
2005
Springer
15 years 7 months ago
Transactions in RCCS
We propose a formalisation of the notion of transaction, using a variant of CCS, RCCS, that distinguishes reversible and irreversible actions, and incorporates a distributed backtr...
Vincent Danos, Jean Krivine
JETAI
2008
93views more  JETAI 2008»
15 years 1 months ago
The message management asynchronous backtracking algorithm
: This paper shows how the Asynchronous Backtracking (Yokoo et al., 1998) algorithm, a well known distributed constraint satisfaction algorithm, produces unnecessary messages and i...
Hong Jiang, José M. Vidal
SC
2003
ACM
15 years 7 months ago
GridSAT: A Chaff-based Distributed SAT Solver for the Grid
We present GridSAT, a parallel and complete satisfiability solver designed to solve non-trivial SAT problem instances using a large number of widely distributed and heterogeneous...
Wahid Chrabakh, Richard Wolski