605 search results - page 101 / 121 » Comparison of Evolutionary Algorithms for Design Optimizatio... |
ASPDAC
2005
ACM
14 years 1 months ago
2005
ACM
– Reducing power consumption through high-level synthesis has attracted a growing interest from researchers due to its large potential for power reduction. In this work we study ...
GECCO
2009
Springer
14 years 8 days ago
2009
Springer
Given the complexity of the problem, genetic algorithms are one of the more promising methods of discovering control schemes for soft robotics. Since physically embodied evolution...
GECCO
2009
Springer
14 years 2 months ago
2009
Springer
The need for a stopping criterion in MOEA’s is a repeatedly mentioned matter in the domain of MOOP’s, even though it is usually left aside as secondary, while stopping criteri...
UIST
2006
ACM
14 years 1 months ago
2006
ACM
NP-hard combinatorial optimization problems are common in real life. Due to their intractability, local search algorithms are often used to solve such problems. Since these algori...
DAC
2010
ACM
13 years 11 months ago
2010
ACM
—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 ...