6894 search results - page 38 / 1379 » Generation Problems |
143
click to vote
AIPS
2004
15 years 7 months ago
2004
This paper considers the problem of generating partial order schedules (
157
click to vote
DIS
2009
Springer
16 years 16 days ago
2009
Springer
Abstract. We propose a new boosting algorithm based on a linear programming formulation. Our algorithm can take advantage of the sparsity of the solution of the underlying optimiza...
151
click to vote
AE
2007
Springer
16 years 4 days ago
2007
Springer
We present GP-HH, a framework for evolving local-search 3-SAT heuristics based on GP. The aim is to obtain “disposable” heuristics which are evolved and used for a specific su...
185
click to vote
CEC
2005
IEEE
15 years 11 months ago
2005
IEEE
A new radii-based evolutionary algorithm (EA) designed for multimodal optimization problems is proposed. The approach can be placed within the genetic chromodynamics framework and ...
161
click to vote
WSC
2007
15 years 8 months ago
2007
The problem of finding the binomial population with the highest success probability is considered when the number of binomial populations is large. A new rigorous indifference zo...