Sciweavers

670 search results - page 56 / 134
» Inclusion-Based Approximate Reasoning
Sort
View
ICRA
2010
IEEE
142views Robotics» more  ICRA 2010»
13 years 6 months ago
A quadratic regulator-based heuristic for rapidly exploring state space
Abstract— Kinodynamic planning algorithms like RapidlyExploring Randomized Trees (RRTs) hold the promise of finding feasible trajectories for rich dynamical systems with complex...
Elena Leah Glassman, Russ Tedrake
ICRA
2010
IEEE
126views Robotics» more  ICRA 2010»
13 years 6 months ago
Simulation-based LQR-trees with input and state constraints
— We present an algorithm that probabilistically covers a bounded region of the state space of a nonlinear system with a sparse tree of feedback stabilized trajectories leading t...
Philipp Reist, Russ Tedrake
ECCV
2004
Springer
14 years 9 months ago
The Least-Squares Error for Structure from Infinitesimal Motion
We analyze the least?squares error for structure from motion with a single infinitesimal motion ("structure from optical flow"). We present asymptotic approximations to ...
John Oliensis
SIGMOD
2002
ACM
134views Database» more  SIGMOD 2002»
14 years 8 months ago
Wavelet synopses with error guarantees
Recent work has demonstrated the effectiveness of the wavelet decomposition in reducing large amounts of data to compact sets of wavelet coefficients (termed "wavelet synopse...
Minos N. Garofalakis, Phillip B. Gibbons
COCO
2005
Springer
99views Algorithms» more  COCO 2005»
14 years 1 months ago
On the Complexity of Succinct Zero-Sum Games
We study the complexity of solving succinct zero-sum games, i.e., the games whose payoff matrix M is given implicitly by a Boolean circuit C such that M(i, j) = C(i, j). We comple...
Lance Fortnow, Russell Impagliazzo, Valentine Kaba...