Sciweavers

52 search results - page 4 / 11
» A Theoretical Analysis of Optimization by Gaussian Continuat...
Sort
View
PLDI
2010
ACM
14 years 16 days ago
Smooth interpretation
We present smooth interpretation, a method to systematically approximate numerical imperative programs by smooth mathematical functions. This approximation facilitates the use of ...
Swarat Chaudhuri, Armando Solar-Lezama
ICALP
2003
Springer
14 years 20 days ago
Analysis of a Simple Evolutionary Algorithm for Minimization in Euclidean Spaces
Although evolutionary algorithms (EAs) are widely used in practical optimization, their theoretical analysis is still in its infancy. Up to now results on the (expected) runtime ar...
Jens Jägersküpper
CDC
2010
IEEE
151views Control Systems» more  CDC 2010»
13 years 2 months ago
On the optimal solutions of the infinite-horizon linear sensor scheduling problem
This paper studies the infinite-horizon sensor scheduling problem for linear Gaussian processes with linear measurement functions. Several important properties of the optimal infin...
Wei Zhang, Michael P. Vitus, Jianghai Hu, Alessand...
GECCO
2008
Springer
152views Optimization» more  GECCO 2008»
13 years 8 months ago
Designing EDAs by using the elitist convergent EDA concept and the boltzmann distribution
This paper presents a theoretical definition for designing EDAs called Elitist Convergent Estimation of Distribution Algorithm (ECEDA), and a practical implementation: the Boltzm...
Sergio Ivvan Valdez Peña, Arturo Hern&aacut...
EOR
2008
69views more  EOR 2008»
13 years 7 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