211 search results - page 17 / 43 » Optimality Theory and the Generative Complexity of Constrain... |
GECCO
2000
Springer
13 years 11 months ago
2000
Springer
This paper presents a novel evolvable hardware framework for the automated design of digital circuits for high performance applications. The technique evolves circuits correspondi...
KI
2009
Springer
14 years 2 months ago
2009
Springer
Today’s complex production systems allow to simultaneously build different products following individual production plans. Such plans may fail due to component faults or unfores...
ISSAC
1997
Springer
1997
Springer
The Minimised Geometric Buchberger Algorithm: An Optimal Algebraic Algorithm for Integer Programming
14 years 1 days ago
IP problems characterise combinatorial optimisation problems where conventional numerical methods based on the hill-climbing technique can not be directly applied. Conventional me...
ISPD
2012
ACM
12 years 3 months ago
2012
ACM
Gate sizing in VLSI design is a widely-used method for power or area recovery subject to timing constraints. Several previous works have proposed gate sizing heuristics for power ...
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
A powerful approach to search is to try to learn a distribution of good solutions (in particular of the dependencies between their variables) and use this distribution as a basis ...