39 search results - page 5 / 8 » Nullness Analysis in Boolean Form |
ICFCA
2009
Springer
15 years 4 months ago
2009
Springer
Matrix decomposition methods provide representations of an object-variable data matrix by a product of two different matrices, one describing relationship between objects and hidd...
EOR
2007
14 years 9 months ago
2007
The motivation of this paper is to obtain an analytical closed form of a quadratic objective function arising from a stochastic decision process with bivariate exponential probabi...
ICCAD
2001
IEEE
15 years 6 months ago
2001
IEEE
Methods based on Boolean satisfiability (SAT) typically use a Conjunctive Normal Form (CNF) representation of the Boolean formula, and exploit the structure of the given problem ...
ISLPED
2009
ACM
15 years 4 months ago
2009
ACM
Many techniques for power management employed in advanced RTL synthesis tools rely explicitly or implicitly on observability don’t-care (ODC) conditions. In this paper we presen...
141
click to vote
DLS
2009
14 years 7 months ago
2009
Ruby is a popular, dynamic scripting language that aims to "feel natural to programmers"and give users the"freedom to choose" among many different ways of doin...