2957 search results - page 515 / 592 » The Complexity of Polynomial-Time Approximation |
IJRR
2008
13 years 7 months ago
2008
We present a novel locomotion strategy called legless locomotion that allows a round-bodied legged robot to locomote approximately when it is high-centered. Typically, a high-cent...
CGF
2007
13 years 7 months ago
2007
Fast contact handling of soft articulated characters is a computationally challenging problem, in part due to complex interplay between skeletal and surface deformation. We presen...
JAIR
2008
13 years 7 months ago
2008
Probabilistic planning problems are typically modeled as a Markov Decision Process (MDP). MDPs, while an otherwise expressive model, allow only for sequential, non-durative action...
JBI
2008
13 years 7 months ago
2008
The complexity of quantitative biomedical models, and the rate at which they are published, is increasing to a point where managing the information has become all but impossible w...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
The problem of recovering the sparsity pattern of a fixed but unknown vector β∗ ∈ Rp based on a set of n noisy observations arises in a variety of settings, including subset...