Sciweavers

1278 search results - page 144 / 256
» The Complexity of Weighted Boolean
Sort
View
STOC
2003
ACM
102views Algorithms» more  STOC 2003»
14 years 10 months ago
Some 3CNF properties are hard to test
For a Boolean formula on n variables, the associated property P is the collection of n-bit strings that satisfy . We study the query complexity of tests that distinguish (with hig...
Eli Ben-Sasson, Prahladh Harsha, Sofya Raskhodniko...
CEC
2009
IEEE
14 years 5 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
FCT
2009
Springer
14 years 5 months ago
Small-Space Analogues of Valiant's Classes
In the uniform circuit model of computation, the width of a boolean circuit exactly characterises the “space” complexity of the computed function. Looking for a similar relatio...
Meena Mahajan, B. V. Raghavendra Rao
FMCAD
2009
Springer
14 years 5 months ago
Retiming and resynthesis with sweep are complete for sequential transformation
— There is a long history of investigations and debates on whether a sequence of retiming and resynthesis is complete for all sequential transformations (on steady states). It ha...
Hai Zhou
GECCO
2009
Springer
14 years 5 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...