Sciweavers

16082 search results - page 119 / 3217
» Fireworks Algorithm for Optimization
Sort
View
126
Voted
CEC
2005
IEEE
15 years 4 months ago
DynDE: a differential evolution for dynamic optimization problems
Abstract- This paper presents an approach of using Differential Evolution (DE) to solve dynamic optimization problems. Careful setting of parameters is necessary for DE algorithms ...
Rui Mendes, Arvind S. Mohais
117
Voted
SODA
1996
ACM
121views Algorithms» more  SODA 1996»
15 years 4 months ago
Optimal Placement of Convex Polygons to Maximize Point Containment
Given a convex polygon P with m vertices and a set S of n points in the plane, we consider the problem of nding a placement of P that contains the maximum number of points in S. W...
Matthew Dickerson, Daniel Scharstein
93
Voted
CORR
2008
Springer
131views Education» more  CORR 2008»
15 years 2 months ago
Optimizing polynomials for floating-point implementation
The floating-point implementation of a function often reduces to a polynomial approximation on an interval. Remez algorithm provides the polynomial closest to the function, but th...
Florent de Dinechin, Christoph Quirin Lauter
151
Voted
CEC
2011
IEEE
14 years 2 months ago
On universal search strategies for multi-criteria optimization using weighted sums
—We develop a stochastic local search algorithm for finding Pareto points for multi-criteria optimization problems. The algorithm alternates between different single-criterium o...
Julien Legriel, Scott Cotton, Oded Maler
215
Voted
PC
2011
314views Management» more  PC 2011»
14 years 9 months ago
Restart strategies in optimization: parallel and serial cases
This paper addresses the problem of minimizing the average running time of the Las Vegas type algorithm, both in serial and parallel setups. The necessary conditions for the exist...
Oleg V. Shylo, Timothy Middelkoop, Panos M. Pardal...