Sciweavers

10901 search results - page 139 / 2181
» Approximations in Distributed Optimization
Sort
View
GECCO
2006
Springer
130views Optimization» more  GECCO 2006»
15 years 10 months ago
Filter approximation using explicit time and frequency domain specifications
We demonstrate that enhanced particle swarm optimization (PSO) can be successfully used to evolve high performance filter approximations. These evolved approximations use sets of ...
Varun Aggarwal, Wesley O. Jin, Una-May O'Reilly
WSC
2008
15 years 8 months ago
The mathematics of continuous-variable simulation optimization
Continuous-variable simulation optimization problems are those optimization problems where the objective function is computed through stochastic simulation and the decision variab...
Sujin Kim, Shane G. Henderson
ATMOS
2007
177views Optimization» more  ATMOS 2007»
15 years 8 months ago
Approximate dynamic programming for rail operations
Abstract. Approximate dynamic programming offers a new modeling and algorithmic strategy for complex problems such as rail operations. Problems in rail operations are often modeled...
Warren B. Powell, Belgacem Bouzaïene-Ayari
JAT
2008
57views more  JAT 2008»
15 years 6 months ago
Sharp approximations to the Bernoulli periodic functions by trigonometric polynomials
We obtain optimal trigonometric polynomials of a given degree N that majorize, minorize and approximate in L1(R/Z) the Bernoulli periodic functions. These are the periodic analogue...
Emanuel Carneiro
COLOGNETWENTE
2010
15 years 5 months ago
Approximating Independent Set in Semi-Random Graphs
We present an algorithm for the independent set problem on semi-random graphs, which are generated as follows: An adversary chooses an n-vertex graph, and then each edge is flipp...
Bodo Manthey, Kai Plociennik