5316 search results - page 32 / 1064 » Which Search Problems Are Random |
101
Voted
AMAI
2004
Springer
15 years 6 months ago
2004
Springer
Recent dynamic local search (DLS) algorithms such as SAPS are amongst the state-of-the-art methods for solving the propositional satisfiability problem (SAT). DLS algorithms modi...
88
Voted
WSC
1997
15 years 2 months ago
1997
The problem of searching for important factors in a simulation model is considered when the simulation output is subject to stochastic variation. Bettonvil and Kleijnen (1996) giv...
124
Voted
CORR
2012
Springer
13 years 8 months ago
2012
Springer
Graphs are fundamental data structures and have been employed for centuries to model real-world systems and phenomena. Random walk with restart (RWR) provides a good proximity sco...
124
click to vote
ESA
2008
Springer
15 years 2 months ago
2008
Springer
Online interval selection is a problem in which intervals arrive one by one, sorted by their left endpoints. Each interval has a length and a non-negative weight associated with i...
116
Voted
CPC
2007
15 years 20 days ago
2007
Abstract. This paper is devoted to an online variant of the minimum spanning tree problem in randomly weighted graphs. We assume that the input graph is complete and the edge weigh...