Sciweavers

5331 search results - page 700 / 1067
» Algebraic Methods for Optimization Problems
Sort
View
DAC
2010
ACM
15 years 10 months ago
Eyecharts: constructive benchmarking of gate sizing heuristics
—Discrete gate sizing is one of the most commonly used, flexible, and powerful techniques for digital circuit optimization. The underlying problem has been proven to be NP-hard ...
Puneet Gupta, Andrew B. Kahng, Amarnath Kasibhatla...
GECCO
2006
Springer
128views Optimization» more  GECCO 2006»
15 years 10 months ago
FTXI: fault tolerance XCS in integer
In the realm of data mining, several key issues exists in the traditional classification algorithms, such as low readability, large rule number, and low accuracy with information ...
Hong-Wei Chen, Ying-Ping Chen
GECCO
2000
Springer
168views Optimization» more  GECCO 2000»
15 years 10 months ago
A Fault-tolerant Multicast Routing Algorithm in ATM Networks
This paper presents a genetic algorithm based method to solve the capacity and routing assignment problem arising in the design of selfhealing networks using the Virtual Path (VP)...
Sam Kwong, S. S. Chan
GECCO
2010
Springer
157views Optimization» more  GECCO 2010»
15 years 10 months ago
Speeding up the evaluation of evolutionary learning systems using GPGPUs
In this paper we introduce a method for computing fitness in evolutionary learning systems based on NVIDIA’s massive parallel technology using the CUDA library. Both the match ...
María A. Franco, Natalio Krasnogor, Jaume B...
GECCO
2008
Springer
104views Optimization» more  GECCO 2008»
15 years 7 months ago
Protein-protein functional association prediction using genetic programming
Determining if a group of proteins are functionally associated among themselves is an open problem in molecular biology. Within our long term goal of applying Genetic Programming ...
Beatriz García, Ricardo Aler, Agapito Ledez...