1046 search results - page 36 / 210 » Approximation Algorithms for Domination Search |
127
click to vote
ATAL
2007
Springer
15 years 4 months ago
2007
Springer
The dominant existing routing strategies employed in peerto-peer(P2P) based information retrieval(IR) systems are similarity-based approaches. In these approaches, agents depend o...
110
Voted
STOC
2003
ACM
16 years 22 days ago
2003
ACM
In this paper, we show that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is O(log n). This ...
100
Voted
EMO
2006
Springer
15 years 4 months ago
2006
Springer
The design of quality measures for approximations of the Pareto-optimal set is of high importance not only for the performance assessment, but also for the construction of multiobj...
CEC
2007
IEEE
15 years 6 months ago
2007
IEEE
Abstract—Hybrid methods are very popular for solving problems from combinatorial optimization. In contrast to this the theoretical understanding of the interplay of different opt...
103
Voted
PRICAI
2000
Springer
15 years 4 months ago
2000
Springer
This paper introduces the even-odd POMDP, an approximation to POMDPs in which the world is assumed to be fully observable every other time step. The even-odd POMDP can be converte...