98 search results - page 9 / 20 » Cut-and-solve: An iterative search strategy for combinatoria... |
CPAIOR
2010
Springer
13 years 5 months ago
2010
Springer
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
GECCO
2010
Springer
13 years 9 months ago
2010
Springer
Several population-based methods (with origins in the world of evolutionary strategies and estimation-of-distribution algorithms) for black-box optimization in continuous domains ...
ICAI
2004
13 years 8 months ago
2004
An explicit exploration strategy is necessary in reinforcement learning (RL) to balance the need to reduce the uncertainty associated with the expected outcome of an action and the...
CEC
2007
IEEE
13 years 11 months ago
2007
IEEE
Routing in computer networks is a nonlinear combinatorial optimization problem with numerous constraints and is classified as an NP-complete problem. There are certain important Qo...
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
We focus on the handling of overlapping solutions in evolutionary multiobjective optimization (EMO) algorithms. First we show that there exist a large number of overlapping soluti...