Sciweavers

135 search results - page 15 / 27
» Real-Coded Genetic Algorithm for Solving Generalized Polynom...
Sort
View
DAC
2009
ACM
14 years 9 months ago
Provably good and practically efficient algorithms for CMP dummy fill
Abstract--To reduce chip-scale topography variation in Chemical Mechanical Polishing (CMP) process, dummy fill is widely used to improve the layout density uniformity. Previous res...
Chunyang Feng, Hai Zhou, Changhao Yan, Jun Tao, Xu...
GECCO
2011
Springer
248views Optimization» more  GECCO 2011»
13 years 2 days ago
Size-based tournaments for node selection
In genetic programming, the reproductive operators of crossover and mutation both require the selection of nodes from the reproducing individuals. Both unbiased random selection a...
Thomas Helmuth, Lee Spector, Brian Martin
GECCO
2007
Springer
173views Optimization» more  GECCO 2007»
14 years 2 months ago
A hybrid GA for a supply chain production planning problem
The problem of production and delivery lot-sizing and scheduling of set of items in a two-echelon supply chain over a finite planning horizon is addressed in this paper. A single ...
Masoud Jenabi, S. Ali Torabi, S. Afshin Mansouri
RECOMB
2006
Springer
14 years 9 months ago
Inferring Gene Orders from Gene Maps Using the Breakpoint Distance
Abstract. Preliminary to most comparative genomics studies is the annotation of chromosomes as ordered sequences of genes. Unfortunately, different genetic mapping techniques usual...
Guillaume Blin, Eric Blais, Pierre Guillon, Mathie...
CP
2006
Springer
14 years 10 days ago
Constraint Satisfaction with Bounded Treewidth Revisited
Abstract. The constraint satisfaction problem can be solved in polynomial time for instances where certain parameters (e.g., the treewidth of primal graphs) are bounded. However, t...
Marko Samer, Stefan Szeider