Sciweavers

1046 search results - page 36 / 210
» Approximation Algorithms for Domination Search
Sort
View
ATAL
2007
Springer
14 years 15 days ago
A reinforcement learning based distributed search algorithm for hierarchical peer-to-peer information retrieval systems
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...
Haizheng Zhang, Victor R. Lesser
STOC
2003
ACM
130views Algorithms» more  STOC 2003»
14 years 8 months ago
A tight bound on approximating arbitrary metrics by tree metrics
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 ...
Jittat Fakcharoenphol, Satish Rao, Kunal Talwar
EMO
2006
Springer
158views Optimization» more  EMO 2006»
14 years 5 days ago
The Hypervolume Indicator Revisited: On the Design of Pareto-compliant Indicators Via Weighted Integration
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...
Eckart Zitzler, Dimo Brockhoff, Lothar Thiele
CEC
2007
IEEE
14 years 2 months ago
On improving approximate solutions by evolutionary algorithms
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...
Tobias Friedrich, Jun He, Nils Hebbinghaus, Frank ...
PRICAI
2000
Springer
14 years 2 days ago
A POMDP Approximation Algorithm That Anticipates the Need to Observe
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...
Valentina Bayer Zubek, Thomas G. Dietterich