Sciweavers

51 search results - page 1 / 11
» An Evolutionary Algorithm for Optimization of Pseudo Kroneck...
Sort
View
ISMVL
2010
IEEE
158views Hardware» more  ISMVL 2010»
13 years 11 months ago
An Evolutionary Algorithm for Optimization of Pseudo Kronecker Expressions
—Using EXOR gates in logic synthesis often results in smaller circuit realizations. While in AND/OR synthesis the problem definition is clear, in AND/EXOR synthesis several clas...
Alexander Finder, Rolf Drechsler
SAT
2004
Springer
97views Hardware» more  SAT 2004»
14 years 22 days ago
Using Lower-Bound Estimates in SAT-Based Pseudo-Boolean Optimization
Linear Pseudo-Boolean constraints offer a much more compact formalism to express significant boolean problems in several areas, ranging from Artificial Intelligence to Electroni...
Vasco M. Manquinho, João P. Marques Silva
GECCO
2007
Springer
179views Optimization» more  GECCO 2007»
14 years 1 months ago
Evolutionary selection of minimum number of features for classification of gene expression data using genetic algorithms
Selecting the most relevant factors from genetic profiles that can optimally characterize cellular states is of crucial importance in identifying complex disease genes and biomark...
Alper Küçükural, Reyyan Yeniterzi...
GECCO
2008
Springer
131views Optimization» more  GECCO 2008»
13 years 8 months ago
Rigorous analyses of fitness-proportional selection for optimizing linear functions
Rigorous runtime analyses of evolutionary algorithms (EAs) mainly investigate algorithms that use elitist selection methods. Two algorithms commonly studied are Randomized Local S...
Edda Happ, Daniel Johannsen, Christian Klein, Fran...
COLT
2008
Springer
13 years 9 months ago
Almost Tight Upper Bound for Finding Fourier Coefficients of Bounded Pseudo- Boolean Functions
A pseudo-Boolean function is a real-valued function defined on {0, 1}n . A k-bounded function is a pseudo-Boolean function that can be expressed as a sum of subfunctions each of w...
Sung-Soon Choi, Kyomin Jung, Jeong Han Kim