440 search results - page 19 / 88 » Local Search Heuristics for the Multidimensional Assignment ... |
GECCO
2009
Springer
14 years 2 months ago
2009
Springer
A variant of two-dimensional packing problem was given in the GECCO’2008 competition. This paper describes the genetic algorithm that produced the best result and thus won the N...
GECCO
2009
Springer
14 years 2 months ago
2009
Springer
Hyper-heuristics can be thought of as “heuristics to choose heuristics”. They are concerned with adaptively finding solution methods, rather than directly producing a solutio...
JAIR
2006
13 years 7 months ago
2006
This paper presents a new framework for anytime heuristic search where the task is to achieve as many goals as possible within the allocated resources. We show the inadequacy of t...
SARA
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. In constraint satisfaction, local search is an incomplete method for finding a solution to a problem. Solving a general constraint satisfaction problem (CSP) is known to...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
Given a connected, undirected graph G with labeled edges, the minimum-label spanning tree problem seeks a spanning tree on G to whose edges are attached the smallest possible numb...