Sciweavers

530 search results - page 86 / 106
» Bounds on marginal probability distributions
Sort
View
ICRA
2003
IEEE
222views Robotics» more  ICRA 2003»
14 years 1 months ago
Path planning using learned constraints and preferences
— In this paper we present a novel method for robot path planning based on learning motion patterns. A motion pattern is defined as the path that results from applying a set of ...
Gregory Dudek, Saul Simhon
DEXA
2003
Springer
149views Database» more  DEXA 2003»
14 years 1 months ago
Capturing Uncertainty in Spatial Queries over Imprecise Data
Emerging applications using miniature electronic devices (e.g., tracking mobile objects using sensors) generate very large amounts of highly dynamic data that poses very high overh...
Xingbo Yu, Sharad Mehrotra
FOCS
2004
IEEE
13 years 11 months ago
Extracting Randomness Using Few Independent Sources
In this work we give the first deterministic extractors from a constant number of weak sources whose entropy rate is less than 1/2. Specifically, for every > 0 we give an expl...
Boaz Barak, Russell Impagliazzo, Avi Wigderson
AAAI
2008
13 years 10 months ago
Towards Faster Planning with Continuous Resources in Stochastic Domains
Agents often have to construct plans that obey resource limits for continuous resources whose consumption can only be characterized by probability distributions. While Markov Deci...
Janusz Marecki, Milind Tambe
GECCO
2008
Springer
123views Optimization» more  GECCO 2008»
13 years 9 months ago
Precision, local search and unimodal functions
We investigate the effects of precision on the efficiency of various local search algorithms on 1-D unimodal functions. We present a (1 + 1)-EA with adaptive step size which fin...
Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wege...