5316 search results - page 192 / 1064 » Which Search Problems Are Random |
127
click to vote
EVOW
2001
Springer
15 years 8 months ago
2001
Springer
In this article we investigate the application of iterated local search (ILS) to the single machine total weighted tardiness problem. Our research is inspired by the recently propo...
188
click to vote
STOC
2000
ACM
15 years 8 months ago
2000
ACM
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
100
Voted
ICRA
2007
IEEE
15 years 10 months ago
2007
IEEE
— Coalescence is the problem of isolated mobile robots independently searching for peers with the goal of forming a single connected network. This is important because communicat...
152
Voted
PPSN
2004
Springer
15 years 9 months ago
2004
Springer
Bayesian networks (BN) constitute a useful tool to model the joint distribution of a set of random variables of interest. To deal with the problem of learning sensible BN models fr...
131
click to vote
SSS
2009
Springer
15 years 10 months ago
2009
Springer
Graph searching games have been extensively studied in the past years. The graph searching problem involves a team of searchers who are attempting to capture a fugitive moving alon...