45 search results - page 5 / 9 » Random Constraint Satisfaction: A More Accurate Picture |
WSDM
2010
ACM
15 years 4 months ago
2010
ACM
Web search engines are traditionally evaluated in terms of the relevance of web pages to individual queries. However, relevance of web pages does not tell the complete picture, si...
AAI
2006
14 years 9 months ago
2006
The problem of finding a high quality timetable for personnel in a hospital ward has been addressed by many researchers, personnel managers and schedulers over a number of years. ...
CORR
2006
Springer
14 years 9 months ago
2006
Springer
: A local search algorithm operating on an instance of a Boolean constraint satisfaction problem (in particular, k-SAT) can be viewed as a stochastic process traversing successive ...
111
click to vote
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
CP
2000
Springer
15 years 1 months ago
2000
Springer
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...