2583 search results - page 148 / 517 » On the Representation of Timed Polyhedra |
181
click to vote
ICCAD
1997
IEEE
15 years 10 months ago
1997
IEEE
In this paper we present an algorithm for converting a BDD representation of a logic function into a multiple-level netlist of disjoint-support subfunctions. On the theoretical si...
163
click to vote
ISAAC
2000
Springer
15 years 10 months ago
2000
Springer
We describe an algorithm for enumerating all vertices, edges and faces of a planar subdivision stored in any of the usual pointer-based representations, while using only a constant...
161
click to vote
SNPD
2004
15 years 7 months ago
2004
A typical problem formal verification faces is the size of the model of a system being verified. Even for a small system, the state space of the model tends to grow exponentially (...
182
click to vote
CCCG
1998
15 years 7 months ago
1998
In this paper, we study weak {proximity drawings. All known algorithms that compute (weak) proximity drawings produce representations whose area increases exponentiallywith the nu...
141
click to vote
COLING
1992
15 years 7 months ago
1992
This paper focuses on a theory of tense and aspect (the representation of time in natural language) that attempts a formM representation of the relevant liltguistic devices as imp...