Sciweavers

908 search results - page 136 / 182
» Heuristic Methods for Solving Job-Shop Scheduling Problems
Sort
View
GECCO
2008
Springer
137views Optimization» more  GECCO 2008»
15 years 3 months ago
Rank based variation operators for genetic algorithms
We show how and why using genetic operators that are applied with probabilities that depend on the fitness rank of a genotype or phenotype offers a robust alternative to the Sim...
Jorge Cervantes, Christopher R. Stephens
IDA
2000
Springer
15 years 1 months ago
Reducing redundancy in characteristic rule discovery by using integer programming techniques
The discovery of characteristic rules is a well-known data mining task and has lead to several successful applications. However, because of the descriptive nature of characteristic...
Tom Brijs, Koen Vanhoof, Geert Wets
DAC
2009
ACM
16 years 2 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
2007
Springer
177views Optimization» more  GECCO 2007»
15 years 8 months ago
On the behavioral diversity of random programs
Generating a random sampling of program trees with specified function and terminal sets is the initial step of many program evolution systems. I present a theoretical and experim...
Moshe Looks
EDBT
2012
ACM
257views Database» more  EDBT 2012»
13 years 4 months ago
Indexing and mining topological patterns for drug discovery
Increased availability of large repositories of chemical compounds has created new challenges and opportunities for the application of data-mining and indexing techniques to probl...
Sayan Ranu, Ambuj K. Singh