165 search results - page 7 / 33 » From an approximate to an exact absolute polynomial factoriz... |
162
click to vote
SOFSEM
2007
Springer
16 years 3 days ago
2007
Springer
The problem of finding k minimum energy, edge-disjoint paths in wireless networks (MEEP) arises in the context of routing and belongs to the class of range assignment problems. A ...
148
click to vote
STOC
2005
ACM
16 years 6 months ago
2005
ACM
A low-distortion embedding between two metric spaces is a mapping which preserves the distances between each pair of points, up to a small factor called distortion. Low-distortion...
155
click to vote
ICDT
2005
ACM
15 years 11 months ago
2005
ACM
We propose and investigate from the algorithmic standpoint a novel form of fuzzy query called approximately dominating representatives or ADRs. The ADRs of a multidimensional point...
194
click to vote
SIGECOM
2011
ACM
14 years 8 months ago
2011
ACM
In a landmark paper, Papadimitriou and Roughgarden [2008] described a polynomial-time algorithm (“Ellipsoid Against Hope”) for computing sample correlated equilibria of concis...
155
click to vote
IJCAI
2001
15 years 7 months ago
2001
This paper describes an algorithm for solving large state-space MDPs (represented as factored MDPs) using search by successive refinement in the space of non-homogeneous partition...