4255 search results - page 214 / 851 » On Learning Boolean Functions |
140
click to vote
ICCD
1991
IEEE
15 years 10 months ago
1991
IEEE
This article proposes a completion-detection method for efficiently implementing Boolean functions as self-timed logic structures. Current-Sensing Completion Detection, CSCD, allow...
190
click to vote
ICCAD
1994
IEEE
15 years 10 months ago
1994
IEEE
This paper describes a procedure for minimizing the power consumption in a boolean network under the zero delay model. Power is minimized by modifying the function of each interme...
140
click to vote
AAAI
2008
15 years 8 months ago
2008
We introduce in this paper two new, complete propositional languages and study their properties in terms of (1) their support for polytime operations and (2) their ability to repr...
152
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
The importance of finding the characteristics leading to either a success or a failure is one of the driving forces of data mining. The various application areas of finding succes...
167
click to vote
CONSTRAINTS
2008
15 years 6 months ago
2008
We describe an approach to modeling biological networks by action languages via answer set programming. To this end, we propose an action language for modeling biological networks...