879 search results - page 49 / 176 » Optimizing for Reduced Code Space using Genetic Algorithms |
162
Voted
SODA
2010
ACM
16 years 19 hour ago
2010
ACM
The quadratic assignment problem (QAP) is a central problem in combinatorial optimization. Several famous computationally hard tasks, such as graph matching, partitioning, and the...
123
Voted
GECCO
2008
Springer
15 years 3 months ago
2008
Springer
We introduce quotient graphs for modeling neutrality in evolutionary search. We demonstrate that for a variety of evolutionary computing problems, search can be characterized by g...
146
Voted
DAC
1999
ACM
15 years 7 months ago
1999
ACM
This paper presents a novel approach for synthesis of analog systems from behavioral VHDL-AMS specifications. We implemented this approach in the VASE behavioral-synthesis tool. ...
111
click to vote
GECCO
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. In this work we have implemented and analyzed the performance of a new real coded steady-state genetic algorithm (SSGA) for the flexible ligand-receptor docking problem....
149
Voted
CGO
2011
IEEE
14 years 6 months ago
2011
IEEE
—Approximating ideal program outputs is a common technique for solving computationally difficult problems, for adhering to processing or timing constraints, and for performance ...