5316 search results - page 134 / 1064 » Which Search Problems Are Random |
131
Voted
FOCS
2006
IEEE
15 years 9 months ago
2006
IEEE
The quantum query complexity of searching for local optima has been a subject of much interest in the recent literature. For the d-dimensional grid graphs, the complexity has been...
105
Voted
EOR
2006
15 years 3 months ago
2006
This paper deals with a multi-stage two-person zero-sum game called the multi-stage search allocation game (MSSAG), in which a searcher and an evader participate. The searcher dist...
164
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Predicting the occurrence of links is a fundamental problem in networks. In the link prediction problem we are given a snapshot of a network and would like to infer which interact...
108
click to vote
IOR
2010
15 years 1 months ago
2010
This paper introduces disjunctive decomposition for two-stage mixed 0-1 stochastic integer programs (SIPs) with random recourse. Disjunctive decomposition allows for cutting plane...
117
click to vote
EVOW
2004
Springer
15 years 9 months ago
2004
Springer
Cellular Genetic Algorithms (cGAs) are a subclass of Genetic Algorithms (GAs) in which the population diversity and exploration are enhanced thanks to the existence of small overla...