Sciweavers

2280 search results - page 140 / 456
» Global Optimization for Optimal Generalized Procrustes Analy...
Sort
View
GECCO
2009
Springer
121views Optimization» more  GECCO 2009»
16 years 1 months ago
Evolutionary algorithms and dynamic programming
Recently, it has been proven that evolutionary algorithms produce good results for a wide range of combinatorial optimization problems. Some of the considered problems are tackled...
Benjamin Doerr, Anton Eremeev, Christian Horoba, F...
AAAI
2008
15 years 9 months ago
Efficient Memoization for Dynamic Programming with Ad-Hoc Constraints
We address the problem of effective reuse of subproblem solutions in dynamic programming. In dynamic programming, a memoed solution of a subproblem can be reused for another if th...
Joxan Jaffar, Andrew E. Santosa, Razvan Voicu
SCHEDULING
2008
72views more  SCHEDULING 2008»
15 years 6 months ago
The impact of local policies on the quality of packet routing in paths, trees, and rings
We consider the packet routing problem in store-and-forward networks whose topologies are either paths, trees, or rings. We are interested by the quality of the solution produced,...
Eric Angel, Evripidis Bampis, Fanny Pascual
202
Voted
GECCO
2010
Springer
157views Optimization» more  GECCO 2010»
15 years 11 months ago
Configuration of a genetic algorithm for multi-objective optimisation of solar gain to buildings
We report the formulation and implementation of a genetic algorithm to address multi-objective optimisation of solar gain to buildings with the goal of minimising energy consumpti...
Ralph Evins
PLDI
2003
ACM
16 years 2 hour ago
Automatically proving the correctness of compiler optimizations
We describe a technique for automatically proving compiler optimizations sound, meaning that their transformations are always semantics-preserving. We first present a domainspeci...
Sorin Lerner, Todd D. Millstein, Craig Chambers