Sciweavers

160 search results - page 26 / 32
» Satisfiability-Based Algorithms for Boolean Optimization
Sort
View
CEC
2009
IEEE
15 years 4 months ago
Evolving modular neural-networks through exaptation
— Despite their success as optimization methods, evolutionary algorithms face many difficulties to design artifacts with complex structures. According to paleontologists, living...
Jean-Baptiste Mouret, Stéphane Doncieux
GECCO
2007
Springer
137views Optimization» more  GECCO 2007»
15 years 4 months ago
Extended probe method for linkage discovery over high-cardinality alphabets
The work addresses the problem of identifying the epistatic linkage of a function from high cardinality alphabets to the real numbers. It is a generalization of Heckendorn and Wri...
Shude Zhou, Zengqi Sun, Robert B. Heckendorn
FOCS
2009
IEEE
15 years 4 months ago
KKL, Kruskal-Katona, and Monotone Nets
We generalize the Kahn-Kalai-Linial (KKL) Theorem to random walks on Cayley and Schreier graphs, making progress on an open problem of Hoory, Linial, and Wigderson. In our general...
Ryan O'Donnell, Karl Wimmer
GECCO
2009
Springer
15 years 4 months ago
On the scalability of XCS(F)
Many successful applications have proven the potential of Learning Classifier Systems and the XCS classifier system in particular in datamining, reinforcement learning, and func...
Patrick O. Stalph, Martin V. Butz, David E. Goldbe...
ICCAD
1997
IEEE
117views Hardware» more  ICCAD 1997»
15 years 2 months ago
Generalized matching from theory to application
This paper presents a novel approach for post-mapping optimization. We exploit the concept of generalized matching, a technique that nds symbolically all possible matching assignm...
Patrick Vuillod, Luca Benini, Giovanni De Micheli