5316 search results - page 305 / 1064 » Which Search Problems Are Random |
150
click to vote
GECCO
2004
Springer
15 years 11 months ago
2004
Springer
Application-specific, parameterized local search algorithms (PLSAs), in which optimization accuracy can be traded off with runtime, arise naturally in many optimization contexts....
146
click to vote
SAT
2004
Springer
15 years 11 months ago
2004
Springer
We propose and study a technique to improve the performance of those local-search SAT solvers that proceed by executing a prespecified number of tries, each starting with an eleme...
160
Voted
AAAI
1998
15 years 7 months ago
1998
Manydesign problems are solved using multiple levels of abstraction, wherea design at one level has combinatorially manychildren at the next level. A stochastic optimization metho...
160
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
A commonly used type of search tree is the alphabetic binary tree, which uses (without loss of generality) "less than" versus "greater than or equal to" tests ...
183
Voted
PVLDB
2010
15 years 27 days ago
2010
Probabilistic data is coming as a new deluge along with the technical advances on geographical tracking, multimedia processing, sensor network and RFID. While similarity search is...