5316 search results - page 57 / 1064 » Which Search Problems Are Random |
124
click to vote
APAL
2011
14 years 7 months ago
2011
We define a new NP search problem, the “local improvement” principle, about labellings of an acyclic, bounded-degree graph. We show that, provably in PV, it characterizes the...
122
click to vote
SIGIR
2008
ACM
15 years 21 days ago
2008
ACM
This paper addresses the issue of query refinement, which involves reformulating ill-formed search queries in order to enhance relevance of search results. Query refinement typica...
STOC
2004
ACM
16 years 1 months ago
2004
ACM
The problem of finding a local minimum of a black-box function is central for understanding local search as well as quantum adiabatic algorithms. For functions on the Boolean hype...
108
click to vote
GECCO
2010
Springer
15 years 29 days ago
2010
Springer
Abstract. Consultant-Guided Search (CGS) is a recent swarm intelligence metaheuristic for combinatorial optimization problems, inspired by the way real people make decisions based ...
100
Voted
HEURISTICS
2010
14 years 7 months ago
2010
The challenge in shift scheduling lies in the construction of a set of work shifts, which are subject to specific regulations, in order to cover fluctuating staff demands. This pro...