1013 search results - page 74 / 203 » A Subexponential Algorithm for Abstract Optimization Problem... |
EVOW
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Finding appropriate parameter values for Evolutionary Algorithms (EAs) is one of the persistent challenges of Evolutionary Computing. In recent publications we showed how...
GECCO
2003
Springer
15 years 3 months ago
2003
Springer
Abstract. This paper describes the application of four evolutionary algorithms to the pruning of neural networks used in classification problems. Besides of a simple genetic algor...
PVM
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. To practically solve NP-hard combinatorial optimization problems, local search algorithms and their parallel implementations on PVM or MPI have been frequently discussed....
DAC
2001
ACM
15 years 10 months ago
2001
ACM
Currently, hardware intellectual property (IP) is delivered at vels of abstraction: hard, firm, and soft. In order to further enhance performance, efficiency, and flexibility of I...
ISAAC
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. Let C be a polygonal cycle on n vertices in the plane. A randomized algorithm is presented which computes in O(n log3 n) expected time, the edge of C whose removal result...