Sciweavers

1672 search results - page 75 / 335
» Tightness problems in the plane
Sort
View
ESA
2011
Springer
260views Algorithms» more  ESA 2011»
12 years 8 months ago
On Variants of the Matroid Secretary Problem
We present a number of positive and negative results for variants of the matroid secretary problem. Most notably, we design a constant-factor competitive algorithm for the “rando...
Shayan Oveis Gharan, Jan Vondrák
ALT
2006
Springer
14 years 5 months ago
Asymptotic Learnability of Reinforcement Problems with Arbitrary Dependence
We address the problem of reinforcement learning in which observations may exhibit an arbitrary form of stochastic dependence on past observations and actions. The task for an age...
Daniil Ryabko, Marcus Hutter
CISS
2008
IEEE
14 years 3 months ago
Partial side information problem: Equivalence of two inner bounds
— Consider the two-terminal partial side information problem, where one source is decoded under a distortion measure, while the other acts as a helper. There are two well known i...
Soumya Jana, Richard E. Blahut
KES
2004
Springer
14 years 2 months ago
The Correspondence Problem in Topological Metric Mapping - Using Absolute Metric Maps to Close Cycles
In Simultaneous Localisation and Mapping (SLAM) the correspondence problem, specifically detecting cycles, is one of the most difficult challenges for an autonomous mobile robot. ...
Margaret E. Jefferies, Michael C. Cosgrove, Jesse ...
ALMOB
2006
97views more  ALMOB 2006»
13 years 9 months ago
The approximability of the String Barcoding problem
The String Barcoding (SBC) problem, introduced by Rash and Gusfield (RECOMB, 2002), consists in finding a minimum set of substrings that can be used to distinguish between all mem...
Giuseppe Lancia, Romeo Rizzi