1968 search results - page 310 / 394 » The Complexity of Valued Constraint Models |
APN
1994
Springer
15 years 2 months ago
1994
Springer
This paper shows how Coloured Petri Nets (CP-nets) can be extended to support synchronous communication. We introduce coloured communication channels through which transitions are...
FMCAD
2004
Springer
15 years 1 months ago
2004
Springer
In this paper we demonstrate a potential extension of formal verification methodology in order to deal with time-domain properties of analog and mixed-signal circuits whose dynamic...
ASPDAC
2005
ACM
14 years 12 months ago
2005
ACM
— We develop a realizable circuit reduction to generate the interconnect macro-model for parasitic estimation in wideband applications. The inductance is represented by VPEC (vec...
VMV
2001
14 years 11 months ago
2001
We present a new approach for the coarse segmentation of tubular structures in 3D image data. Our algorithm, which requires only few initial values and minimal user interaction, c...
107
click to vote
ATVA
2010
Springer
14 years 11 months ago
2010
Springer
We study recursive timed automata that extend timed automata with recursion. Timed automata, as introduced by Alur and Dill, are finite automata accompanied by a finite set of real...