52 search results - page 2 / 11 » The Verus Language: Representing Time Efficiently with BDDs |
ICCAD
1996
IEEE
15 years 6 months ago
1996
IEEE
We presenta new representationfor Boolean functions called PartitionedROBDDs. In this representation we divide the Boolean space into `k' partitions and represent a function ...
91
Voted
RP
2010
Springer
14 years 11 months ago
2010
Springer
Chrobak (1986) proved that a language accepted by a given nondeterministic finite automaton with one-letter alphabet, i.e., a unary NFA, with n states can be represented as the uni...
140
Voted
JAIR
2010
14 years 8 months ago
2010
In many AI domains such as product configuration, a user should interactively specify a solution that must satisfy a set of constraints. In such scenarios, offline compilation of ...
129
click to vote
JMLR
2010
14 years 8 months ago
2010
We present a polynomial update time algorithm for the inductive inference of a large class of context-free languages using the paradigm of positive data and a membership oracle. W...
115
Voted
POPL
1996
ACM
15 years 6 months ago
1996
ACM
that defines abstract costs for measuring or analyzing the performance of computations, (2) to supply the users with a mapping of these costs onto runtimes on various machine model...