2266 search results - page 207 / 454 » Evolutionary Algorithms for the Satisfiability Problem |
136
click to vote
GECCO
2011
Springer
14 years 6 months ago
2011
Springer
Novelty search is a recently proposed method for evolutionary computation designed to avoid the problem of deception, in which the fitness function guides the search process away...
146
click to vote
GECCO
2004
Springer
15 years 8 months ago
2004
Springer
Estimation of distribution algorithms (EDAs) are population-based heuristic search methods that use probabilistic models of good solutions to guide their search. When applied to co...
132
click to vote
DISOPT
2006
15 years 3 months ago
2006
We consider the multiple shift scheduling problem modelled as a covering problem. Such problems are characterized by a constraint matrix that has in every column blocks of consecu...
139
click to vote
ICASSP
2010
IEEE
15 years 3 months ago
2010
IEEE
— Ergodic stochastic optimization (ESO) algorithms are proposed to solve resource allocation problems that involve a random state and where optimality criteria are expressed in t...
136
click to vote
CSI
2006
15 years 3 months ago
2006
In a distributed system, a number of application tasks may need to be assigned to different processors such that the system cost is minimized and the constraints with limited reso...