2343 search results - page 33 / 469 » Visual-Concept Search Solved |
136
click to vote
GECCO
2005
Springer
15 years 9 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...
120
click to vote
EOR
2010
15 years 4 months 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 ...
127
click to vote
IJMC
2006
15 years 3 months 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 ...
128
Voted
JSAT
2008
15 years 3 months 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 ...
140
click to vote
EAAI
2007
15 years 3 months ago
2007
This paper recapitulates the results of a long research on a family of artificial intelligence (AI) methods—relying on, e.g., artificial neural networks and search techniques...