5316 search results - page 298 / 1064 » Which Search Problems Are Random |
172
Voted
SODA
1992
ACM
15 years 7 months ago
1992
ACM
We present several applications in computational geometry of Megiddo's parametric searching technique. These applications include: (1) Finding the minimum Hausdorff distance ...
204
click to vote
DASFAA
2006
IEEE
16 years 4 days ago
2006
IEEE
Efficient full-text keyword search remains a challenging problem in P2P systems. Most of the traditional keyword search systems on DHT overlay networks perform the join operation ...
157
click to vote
ATAL
2009
Springer
16 years 20 days ago
2009
Springer
We introduce an adversarial planning algorithm based on game tree search, which is applicable in large-scale multiplayer domains. In order to tackle the scalability issues of game...
205
click to vote
DISOPT
2011
15 years 1 months ago
2011
SAT and MAX SAT are among the most prominent problems for which local search algorithms have been successfully applied. A fundamental task for such an algorithm is to increase the...
139
click to vote
HIS
2007
15 years 7 months ago
2007
This paper proposes a new approach for multicriteria optimization which aggregates the objective functions and uses a line search method in order to locate an approximate efficien...