5316 search results - page 44 / 1064 » Which Search Problems Are Random |
WAOA
2005
Springer
15 years 6 months ago
2005
Springer
Cellular telephony systems, where locations of mobile users are unknown at some times, are becoming more common. In such systems, mobile users are roaming in a zone and a user repo...
145
Voted
EC
2007
15 years 22 days ago
2007
Randomized search heuristics (e.g., evolutionary algorithms, simulated annealing etc.) are very appealing to practitioners, they are easy to implement and usually provide good per...
222
Voted
ICDE
2008
IEEE
16 years 2 months ago
2008
IEEE
In this paper, we develop a model for representing term dependence based on Markov Random Fields and present an approach based on Markov Chain Monte Carlo technique for generating ...
85
Voted
JAIR
2006
15 years 22 days ago
2006
In this paper, we introduce DLS-MC, a new stochastic local search algorithm for the maximum clique problem. DLS-MC alternates between phases of iterative improvement, during which...
83
Voted
ISAAC
1994
Springer
15 years 4 months ago
1994
Springer
We describe a substring search problem that arises in group presentation simplification processes. We suggest a two-level searching model: skip and match levels. We give two timest...