116 search results - page 11 / 24 » On the solution-space geometry of random constraint satisfac... |
IAT
2003
IEEE
15 years 2 months ago
2003
IEEE
With the increasing use of the internet, many problemsolving tasks such as resource allocation, scheduling, planning, and configuration pose themselves in an open setting involvi...
SODA
2000
ACM
14 years 10 months ago
2000
ACM
: k-SAT is one of the best known among a wide class of random constraint satisfaction problems believed to exhibit a threshold phenomenon where the control parameter is the ratio, ...
AAAI
2007
14 years 11 months ago
2007
We present a new probabilistic framework for finding likely variable assignments in difficult constraint satisfaction problems. Finding such assignments is key to efficient sea...
CPAIOR
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. In constraint programming there are often many choices regarding the propagation method to be used on the constraints of a problem. However, simple constraint solvers usu...
78
Voted
JAL
2008
14 years 9 months ago
2008
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, ...