2467 search results - page 311 / 494 » Finite State Machines |
196
click to vote
MA
2000
Springer
15 years 10 months ago
2000
Springer
In this paper, we present a mechanism to capture and reestablish the state of Java threads. We achieve this by extracting a thread's execution state from the application code ...
159
click to vote
AIPS
2004
15 years 8 months ago
2004
We show that for conditional planning with partial observability the existence problem of plans with success probability 1 is 2-EXP-complete. This result completes the complexity ...
164
click to vote
FORTE
1998
15 years 8 months ago
1998
Test generation and execution are often hampered by the large state spaces of the systems involved. In automata (or transition system) based test algorithms, taking advantage of s...
195
click to vote
PODC
2010
ACM
15 years 6 months ago
2010
ACM
We present information-theoretically secure schemes for sharing and modifying secrets among a dynamic swarm of computing devices. The schemes support an unlimited number of change...
172
click to vote
DI
2007
15 years 6 months ago
2007
All Windows memory analysis techniques depend on the examiner’s ability to translate the virtual addresses used by programs and operating system components into the true locatio...