92 search results - page 5 / 19 » Evolving heuristically difficult instances of combinatorial ... |
CEC
2010
IEEE
14 years 10 months ago
2010
IEEE
Using a recently proposed model for combinatorial landscapes, Local Optima Networks (LON), we conduct a thorough analysis of two types of instances of the Quadratic Assignment Prob...
EOR
2006
14 years 9 months ago
2006
In this paper, we provide a heuristic procedure, that performs well from a global optimality point of view, for an important and difficult class of bilevel programs. The algorithm...
IPPS
2000
IEEE
15 years 1 months ago
2000
IEEE
This paper presents a novel broadband multimedia service called TV-Anytime. The basic idea of this service is to store broadcast media assets onto media server systems and allow c...
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
Several general purpose benchmark generators are now available in the literature. They are convenient tools in dynamic continuous optimization as they can produce test instances w...
FUIN
2010
14 years 8 months ago
2010
Given a set of taxa S and a complete set of quartet topologies Q over S, the problem of determining a phylogeny that satisfies the maximum number of topologies is called the Maxi...