Sciweavers

502 search results - page 65 / 101
» Monotone Approximation of Decision Problems
Sort
View
WADS
2001
Springer
113views Algorithms» more  WADS 2001»
15 years 2 months ago
Movement Planning in the Presence of Flows
This paper investigates the problem of time-optimum movement planning in two and three dimensions for a point robot which has bounded control velocity through a set of n polygonal...
John H. Reif, Zheng Sun
FOCS
2005
IEEE
15 years 3 months ago
A Characterization of the (natural) Graph Properties Testable with One-Sided Error
The problem of characterizing all the testable graph properties is considered by many to be the most important open problem in the area of property-testing. Our main result in thi...
Noga Alon, Asaf Shapira
TIT
2002
62views more  TIT 2002»
14 years 9 months ago
Maximum-likelihood binary shift-register synthesis from noisy observations
We consider the problem of estimating the feedback coefficients of a linear feedback shift register (LFSR) based on noisy observations. In the current approach, the coefficients a...
Todd K. Moon
JMLR
2010
135views more  JMLR 2010»
14 years 4 months ago
Finite-sample Analysis of Bellman Residual Minimization
We consider the Bellman residual minimization approach for solving discounted Markov decision problems, where we assume that a generative model of the dynamics and rewards is avai...
Odalric-Ambrym Maillard, Rémi Munos, Alessa...
IJCAI
2003
14 years 11 months ago
Generalizing Plans to New Environments in Relational MDPs
A longstanding goal in planning research is the ability to generalize plans developed for some set of environments to a new but similar environment, with minimal or no replanning....
Carlos Guestrin, Daphne Koller, Chris Gearhart, Ne...