Sciweavers

400 search results - page 4 / 80
» Backtracking
Sort
View
AAAI
1998
13 years 9 months ago
Generalizing Partial Order and Dynamic Backtracking
RecentlyFtwo new backtracking algorithmsF dynamic backtracking (DB)and partial order dynamicbacktracking (PDB) have been presented. These algorithms have the property to be additi...
Christian Bliek
JETAI
2008
93views more  JETAI 2008»
13 years 8 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
AIPS
2006
13 years 9 months ago
An Empirical Study of Multi-Point Constructive Search for Constraint-Based Scheduling
Multi-point constructive search (MPCS) performs a series of resource-limited backtracking searches where each search begins either from an empty solution (as in randomized restart...
J. Christopher Beck
CP
2000
Springer
14 years 23 days ago
Maintaining Arc-Consistency within Dynamic Backtracking
Most of complete search algorithms over Constraint Satisfaction Problems (csp) are based on Standard Backtracking. Two main enhancements of this basic scheme have been proposed : r...
Narendra Jussien, Romuald Debruyne, Patrice Boizum...
IJCAI
2001
13 years 9 months ago
Backtracking Through Biconnected Components of a Constraint Graph
The algorithm presented here, BCC, is an enhancement of the well known Backtrack used to solve constraint satisfaction problems. Though most backtrack improvements rely on propaga...
Jean-François Baget, Yannic S. Tognetti