3229 search results - page 237 / 646 » The Theory of Timed Automata |
145
click to vote
GLVLSI
2005
IEEE
16 years 7 days ago
2005
IEEE
Quantum-dot Cellular Automata (QCA) is a novel computing mechanism that can represent binary information based on spatial distribution of electron charge configuration in chemica...
161
Voted
ISSS
2002
IEEE
15 years 11 months ago
2002
IEEE
Scheduling is widely recognized as a very important step in highlevel synthesis. Nevertheless, it is usually done without taking into account the effects on the actual hardware im...
168
click to vote
ESOP
2001
Springer
15 years 11 months ago
2001
Springer
The Ambient Calculus was developed by Cardelli and Gordon as a formal framework to study issues of mobility and migrant code [CG98]. We consider an Ambient Calculus where ambients...
165
click to vote
LICS
2000
IEEE
15 years 11 months ago
2000
IEEE
We study definability and complexity issues for automatic and ω-automatic structures. These are, in general, infinite structures but they can be finitely presented by a collec...
160
click to vote
AMAST
2006
Springer
15 years 10 months ago
2006
Springer
We propose two characterizations of complexity classes by means of programming languages. The first concerns Logspace while the second leads to Ptime. This latter characterization ...