7311 search results - page 174 / 1463 » Time in State Machines |
140
click to vote
SPIN
2004
Springer
15 years 10 months ago
2004
Springer
The Murϕ-based Hopper tool is a general purpose explicit model checker. Hopper leverages Murϕ’s class structure to implement new algorithms. Hopper differs from Murϕ in that i...
155
click to vote
FAST
2011
14 years 8 months ago
2011
Application launch performance is of great importance to system platform developers and vendors as it greatly affects the degree of users’ satisfaction. The single most effectiv...
229
Voted
WAOA
2010
Springer
15 years 2 months ago
2010
Springer
We consider the problem to minimize the weighted sum of completion times in nonpreemptive parallel machine scheduling. In a landmark paper from 1986, Kawaguchi and Kyan [5] showed ...
142
click to vote
ATAL
2004
Springer
15 years 10 months ago
2004
Springer
Most BDI agent architectures rely on plan libraries in order to ensure bounded time for means-ends reasoning. Nevertheless, the usage of fast planning algorithms to provide the ag...
145
click to vote
COLING
2008
15 years 6 months ago
2008
This paper elaborates a model for representing semantic calendar expressions (SCEs), which correspond to the intensional meanings of natural-language calendar phrases. The model u...