Sciweavers

705 search results - page 77 / 141
» Approximating Extended Answer Sets
Sort
View
ESA
2011
Springer
260views Algorithms» more  ESA 2011»
13 years 9 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
WSC
2008
15 years 4 days ago
Speeding up call center simulation and optimization by Markov chain uniformization
Staffing and scheduling optimization in large multiskill call centers is time-consuming, mainly because it requires lengthy simulations to evaluate performance measures and their ...
Eric Buist, Wyean Chan, Pierre L'Ecuyer
CIKM
2008
Springer
14 years 11 months ago
A metric cache for similarity search
Similarity search in metric spaces is a general paradigm that can be used in several application fields. It can also be effectively exploited in content-based image retrieval syst...
Fabrizio Falchi, Claudio Lucchese, Salvatore Orlan...
IJCAI
1989
14 years 11 months ago
Coping With Uncertainty in Map Learning
In many applications in mobile robotics, it is important for a robot to explore its environment in order to construct a representation of space useful for guiding movement. We refe...
Kenneth Basye, Thomas Dean, Jeffrey Scott Vitter
CORR
2006
Springer
130views Education» more  CORR 2006»
14 years 9 months ago
On optimal quantization rules for some sequential decision problems
We consider the problem of sequential decentralized detection, a problem that entails several interdependent choices: the choice of a stopping rule (specifying the sample size), a...
XuanLong Nguyen, Martin J. Wainwright, Michael I. ...