Sciweavers

3250 search results - page 47 / 650
» An Algorithm to Solve a Linear Program
Sort
View
GECCO
2007
Springer
293views Optimization» more  GECCO 2007»
14 years 2 months ago
Solving the artificial ant on the Santa Fe trail problem in 20, 696 fitness evaluations
In this paper, we provide an algorithm that systematically considers all small trees in the search space of genetic programming. These small trees are used to generate useful subr...
Steffen Christensen, Franz Oppacher
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...
AAAI
2008
13 years 10 months ago
Efficient Haplotype Inference with Answer Set Programming
Identifying maternal and paternal inheritance is essential to be able to find the set of genes responsible for a particular disease. Although we have access to genotype data (gene...
Esra Erdem, Ferhan Türe
CCE
2008
13 years 8 months ago
Global optimization of multiscenario mixed integer nonlinear programming models arising in the synthesis of integrated water net
The problem of optimal synthesis of an integrated water system is addressed in this work, where water using processes and water treatment operations are combined into a single net...
Ramkumar Karuppiah, Ignacio E. Grossmann
SODA
2000
ACM
120views Algorithms» more  SODA 2000»
13 years 9 months ago
Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks
This paper shows that the minimum ratio canceling algorithm of Wallacher (1989) (and a faster relaxed version) can be generalized to an algorithm for general linear programs with ...
S. Thomas McCormick, Akiyoshi Shioura