20126 search results - page 136 / 4026 » Timed Transition Systems |
130
Voted
CSL
2008
Springer
15 years 5 months ago
2008
Springer
Infinite-state automata are a new invention: they are automata that have an infinite number of states represented by words, transitions defined using rewriting, and with sets of in...
122
Voted
DAC
1999
ACM
16 years 4 months ago
1999
ACM
Matrix-implicit Krylov-subspace methods have made it possible to efficiently compute the periodic steady-state of large circuits using either the time-domain shooting-Newton metho...
133
Voted
HM
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. This paper introduces a new algorithm, based on the concept of ejection chains, to effectively target vehicle routing problems with time window constraints (VRPTW). Ejec...
125
Voted
NOSSDAV
2004
Springer
15 years 8 months ago
2004
Springer
—In mobile devices, the wireless network interface card (WNIC) consumes a significant portion of overall system energy. One way to reduce energy consumed by a WNIC is to transit...
110
Voted
ICDCSW
2000
IEEE
15 years 7 months ago
2000
IEEE
We introduce a technique that can be used to model the behaviour of protocols. In our model each process within a protocol belongs to a particular class. A set of rules governs th...