3475 search results - page 186 / 695 » Backbones in Optimization and Approximation |
164
click to vote
ANOR
2010
15 years 4 months ago
2010
This paper considers online stochastic optimization problems where uncertainties are characterized by a distribution that can be sampled and where time constraints severely limit t...
177
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
The class of constraint satisfactions problems (CSPs) captures many fundamental combinatorial optimization problems such as Max Cut, Max q-Cut, Unique Games, and Max k-Sat. Recent...
173
click to vote
FOCS
2000
IEEE
15 years 11 months ago
2000
IEEE
In many optimization problems, one seeks to allocate a limited set of resources to a set of individuals with demands. Thus, such allocations can naturally be viewed as vectors, wi...
148
click to vote
ICASSP
2008
IEEE
16 years 27 days ago
2008
IEEE
Bayesian estimation in nonlinear stochastic dynamical systems has been addressed for a long time. Among other solutions, Particle Filtering (PF) algorithms propagate in time a Mon...
158
click to vote
ICRA
2002
IEEE
15 years 11 months ago
2002
IEEE
— Closed-loop, asymptotically stable walking motions are designed for a 5-link, planar bipedal robot model with one degree of underactuation. Parameter optimization is applied to...