Sciweavers

13376 search results - page 181 / 2676
» Problem Solving with
Sort
View
149
Voted
GECCO
2007
Springer
326views Optimization» more  GECCO 2007»
15 years 9 months ago
Binary differential evolution for the unit commitment problem
The Unit Commitment Problem (UCP) is the task of finding an optimal turn on and turn off schedule for a group of power generation units over a given time horizon to minimize ope...
Ali Keles
SC
2009
ACM
15 years 8 months ago
GPU based sparse grid technique for solving multidimensional options pricing PDEs
It has been shown that the sparse grid combination technique can be a practical tool to solve high dimensional PDEs arising in multidimensional option pricing problems in finance...
Abhijeet Gaikwad, Ioane Muni Toke
GECCO
2005
Springer
100views Optimization» more  GECCO 2005»
15 years 8 months ago
The MaxSolve algorithm for coevolution
Coevolution can be used to adaptively choose the tests used for evaluating candidate solutions. A long-standing question is how this dynamic setup may be organized to yield reliab...
Edwin D. de Jong
120
Voted
ISSAC
2005
Springer
119views Mathematics» more  ISSAC 2005»
15 years 8 months ago
Computing the multiplicity structure in solving polynomial systems
This paper presents a duality analysis and an algorithm for computing the multiplicity structure of a zero to a polynomial system, while the zero can be exact or approximate with ...
Barry H. Dayton, Zhonggang Zeng
CP
2001
Springer
15 years 7 months ago
Collaborative Learning for Constraint Solving
Abstract. Although constraint programming offers a wealth of strong, generalpurpose methods, in practice a complex, real application demands a person who selects, combines, and ref...
Susan L. Epstein, Eugene C. Freuder