1046 search results - page 29 / 210 » Approximation Algorithms for Domination Search |
90
Voted
AAMAS
2010
Springer
15 years 18 days ago
2010
Springer
This paper investigates cooperative search strategies for agents engaged in costly search in a complex environment. Searching cooperatively, several search goals can be satisfied w...
GECCO
2007
Springer
15 years 6 months ago
2007
Springer
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...
100
Voted
STOC
2006
ACM
16 years 23 days ago
2006
ACM
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
129
Voted
ATAL
2008
Springer
15 years 2 months ago
2008
Springer
When exploring a game over a large strategy space, it may not be feasible or cost-effective to evaluate the payoff of every relevant strategy profile. For example, determining a p...
116
Voted
ISAAC
2007
Springer
15 years 6 months ago
2007
Springer
In this paper, we present two linear-size external memory data structures for approximate range searching. Our first structure, the BAR-B-tree, stores a set of N points in Rd and ...