6036 search results - page 97 / 1208 » Web search solved |
123
Voted
CEC
2008
IEEE
15 years 7 months ago
2008
IEEE
— Deceptive problems are a class of challenging problems for conventional genetic algorithms (GAs), which usually mislead the search to some local optima rather than the global o...
GECCO
2005
Springer
15 years 6 months ago
2005
Springer
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...
96
Voted
EOR
2010
15 years 25 days ago
2010
This paper presents a hybrid metaheuristic approach (HMA) for solving the Unconstrained Binary Quadratic Programming (UBQP) problem. By incorporating a tabu search procedure into ...
103
Voted
IJMC
2006
15 years 22 days ago
2006
: The Channel Assignment Problem is an NP-complete problem to assign a minimum number of channels under certain constraints to requested calls in a cellular radio system. Examples ...
91
Voted
JSAT
2008
15 years 22 days ago
2008
We show how to exploit the 32/64 bit architecture of modern computers to accelerate some of the algorithms used in satisfiability solving by modifying assignments to variables in ...