10901 search results - page 402 / 2181 » Approximations in Distributed Optimization |
196
click to vote
SODA
2010
ACM
16 years 4 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...
181
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...
178
click to vote
ICRA
2002
IEEE
15 years 12 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...
222
click to vote
GECCO
2008
Springer
15 years 8 months ago
2008
Springer
Evolutionary Algorithms’ (EAs’) application to real world optimization problems often involves expensive fitness function evaluation. Naturally this has a crippling effect on ...
175
click to vote
JAL
2002
15 years 6 months ago
2002
The normalized number of key comparisons needed to sort a list of randomly permuted items by the Quicksort algorithm is known to converge in distribution. We identify the rate of ...