Sciweavers

1725 search results - page 210 / 345
» Relaxed genetic programming
Sort
View
GECCO
2007
Springer
163views Optimization» more  GECCO 2007»
15 years 4 months ago
Interactive evolution of XUL user interfaces
We attack the problem of user fatigue by using an interactive genetic algorithm to evolve user interfaces in the XUL interface definition language. The interactive genetic algori...
Juan C. Quiroz, Sushil J. Louis, Sergiu M. Dascalu
GECCO
2007
Springer
183views Optimization» more  GECCO 2007»
15 years 4 months ago
Distribution replacement: how survival of the worst can out perform survival of the fittest
A new family of "Distribution Replacement” operators for use in steady state genetic algorithms is presented. Distribution replacement enforces the members of the populatio...
Howard Tripp, Phil Palmer
FOCS
2005
IEEE
15 years 3 months ago
On Non-Approximability for Quadratic Programs
This paper studies the computational complexity of the following type of quadratic programs: given an arbitrary matrix whose diagonal elements are zero, find x ∈ {−1, +1}n th...
Sanjeev Arora, Eli Berger, Elad Hazan, Guy Kindler...
GECCO
2004
Springer
134views Optimization» more  GECCO 2004»
15 years 3 months ago
Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem
The prize-collecting Steiner tree problem on a graph with edge costs and vertex profits asks for a subtree minimizing the sum of the total cost of all edges in the subtree plus th...
Gunnar W. Klau, Ivana Ljubic, Andreas Moser, Petra...
TCAD
2008
136views more  TCAD 2008»
14 years 10 months ago
A Geometric Programming-Based Worst Case Gate Sizing Method Incorporating Spatial Correlation
We present an efficient optimization scheme for gate sizing in the presence of process variations. Our method is a worst-case design scheme, but it reduces the pessimism involved i...
Jaskirat Singh, Zhi-Quan Luo, Sachin S. Sapatnekar