2583 search results - page 187 / 517 » On the Representation of Timed Polyhedra |
171
click to vote
RISE
2004
Springer
15 years 11 months ago
2004
Springer
In this paper, we develop a symbolic representation for timed concurrent constraint (tccp) programs, which can be used for defining a lightweight model–checking algorithm for re...
149
click to vote
ISCAS
2003
IEEE
15 years 11 months ago
2003
IEEE
We propose a new channel compensation method for modulation spectral features. We compare our proposed method, subband normalization, with a more traditional method, cepstral mean...
162
click to vote
ADC
2004
Springer
15 years 10 months ago
2004
Springer
Most modern database applications contain a significant amount of time dependent data and a substantial proportion of this data is now-relative, i.e. current now. While much resea...
176
click to vote
ICCD
1995
IEEE
15 years 10 months ago
1995
IEEE
– This paper describes a new technique for extracting clock-level finite state machines(FSMs) from transistor netlists using symbolic simulation. The transistor netlist is prepr...
168
click to vote
CAV
2008
Springer
15 years 8 months ago
2008
Springer
Although there are many efficient algorithms for calculating the simulation preorder on finite Kripke structures, only two have been proposed of which the space complexity is of t...