Sciweavers

717 search results - page 63 / 144
» Weak-Commitment Search for Solving Constraint Satisfaction P...
Sort
View
IJCAI
1993
14 years 11 months ago
Domain Filtering can Degrade Intelligent Backtracking Search
This paper presents an improved backjumping algonthm for the constraint satisfaction problem, namely conflictdirected backjumping (CBJ). CBJ is then modified such that it can dete...
Patrick Prosser
JAL
2008
97views more  JAL 2008»
14 years 9 months ago
Experimental studies of variable selection strategies based on constraint weights
An important class of heuristics for constraint satisfaction problems works by sampling information during search in order to inform subsequent decisions. One of these strategies, ...
Richard J. Wallace, Diarmuid Grimes
IJCAI
1993
14 years 11 months ago
Genetic State-Space Search for Constrained Optimization Problems
This paper introduces GSSS (Genetic State-Space Search). The integration of two general search paradigms — genetic search and state-space-search provides a general framework whi...
Jan Paredis
ATAL
2003
Springer
15 years 3 months ago
Cooperative negotiation for soft real-time distributed resource allocation
In this paper we present a cooperative negotiation protocol that solves a distributed resource allocation problem while conforming to soft real-time constraints in a dynamic envir...
Roger Mailler, Victor R. Lesser, Bryan Horling
JETAI
2008
93views more  JETAI 2008»
14 years 9 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