706 search results - page 109 / 142 » On a quasi-ordering on Boolean functions |
ICCAD
1994
IEEE
13 years 11 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...
AAAI
2008
13 years 10 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...
CORR
2010
Springer
13 years 7 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...
CONSTRAINTS
2008
13 years 7 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...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
It is well-known that modal satisfiability is PSPACE-complete [Lad77]. However, the complexity may decrease if we restrict the set of propositional operators used. Note that there ...