Sciweavers

3475 search results - page 88 / 695
» Backbones in Optimization and Approximation
Sort
View
EOR
2008
69views more  EOR 2008»
15 years 2 months ago
On the complexity of optimization over the standard simplex
We review complexity results for minimizing polynomials over the standard simplex and unit hypercube. In addition, we derive new results on the computational complexity of approxi...
E. de Klerk, Dick den Hertog, G. Elabwabi
121
Voted
JMLR
2008
92views more  JMLR 2008»
15 years 2 months ago
Theoretical Advantages of Lenient Learners: An Evolutionary Game Theoretic Perspective
This paper presents the dynamics of multiple learning agents from an evolutionary game theoretic perspective. We provide replicator dynamics models for cooperative coevolutionary ...
Liviu Panait, Karl Tuyls, Sean Luke
GECCO
2007
Springer
235views Optimization» more  GECCO 2007»
15 years 8 months ago
Expensive optimization, uncertain environment: an EA-based solution
Real life optimization problems often require finding optimal solution to complex high dimensional, multimodal problems involving computationally very expensive fitness function e...
Maumita Bhattacharya
ECCC
2010
111views more  ECCC 2010»
15 years 2 months ago
Tight Bounds on the Approximability of Almost-satisfiable Horn SAT and Exact Hitting Set}
We study the approximability of two natural Boolean constraint satisfaction problems: Horn satisfiability and exact hitting set. Under the Unique Games conjecture, we prove the fo...
Venkatesan Guruswami, Yuan Zhou
123
Voted
ICML
2000
IEEE
16 years 3 months ago
Rates of Convergence for Variable Resolution Schemes in Optimal Control
This paper presents a general method to derive tight rates of convergence for numerical approximations in optimal control when we consider variable resolution grids. We study the ...
Andrew W. Moore, Rémi Munos