Sciweavers

1871 search results - page 311 / 375
» The Ephemeral Pairing Problem
Sort
View
GECCO
2005
Springer
182views Optimization» more  GECCO 2005»
15 years 12 months ago
Improving EAX with restricted 2-opt
Edge Assembly Crossover (EAX) is by far the most successful crossover operator in solving the traveling salesman problem (TSP) with Genetic Algorithms (GAs). Various improvements ...
Chen-hsiung Chan, Sheng-An Lee, Cheng-Yan Kao, Hua...
OR
2005
Springer
15 years 12 months ago
Optimal Fares for Public Transport
The fare planning problem for public transport is to design a system of fares that maximize the revenue. We introduce a nonlinear optimization model to approach this problem. It i...
Ralf Borndörfer, Marika Neumann, Marc E. Pfet...
PASTE
2004
ACM
15 years 11 months ago
Resolving and applying constraint queries on context-sensitive analyses
A context-sensitive analysis is an analysis in which program elements are assigned sets of properties that depend upon the context in which they occur. For analyses on imperative ...
James Ezick
GECCO
2003
Springer
189views Optimization» more  GECCO 2003»
15 years 11 months ago
A Forest Representation for Evolutionary Algorithms Applied to Network Design
Abstract. Network design involves several areas of engineering and science. Computer networks, electrical circuits, transportation problems, and phylogenetic trees are some example...
Alexandre C. B. Delbem, André Carlos Ponce ...
ISPD
2000
ACM
113views Hardware» more  ISPD 2000»
15 years 10 months ago
Floorplan area minimization using Lagrangian relaxation
modules can be handled in constraint graphs efficiently. This Floorplan area minimization is an important problem because many modules have shape flexibilities during the floorplan...
Fung Yu Young, Chris C. N. Chu, W. S. Luk, Y. C. W...