328 search results - page 15 / 66 » Simple Termination Revisited |
PUC
2010
13 years 6 months ago
2010
We propose and investigate a paradigm for activity recognition, distinguishing the ‘on-going activity’ recognition task (OGA) from that addressing ‘complete activities’ (C...
ICISC
2009
13 years 5 months ago
2009
Abstract. The design of embedded processors demands a careful tradeoff between many conflicting objectives such as performance, silicon area and power consumption. Finding such a t...
LATIN
2000
Springer
13 years 11 months ago
2000
Springer
We present a very simple algorithm for the Least Common Ancestor problem. We thus dispel the frequently held notion that an optimal LCA computation is unwieldy and unimplementable...
IPL
2007
13 years 7 months ago
2007
In the secure communication problem, we focus on safe termination. In applications such as electronic transactions, we want each party to be ensured that both sides agree on the s...
FSTTCS
2007
Springer
14 years 1 months ago
2007
Springer
We show that any regular set of basic MSCs can be implemented by a deadlock-free communicating finite-state machine with local termination: Processes stop in local dead-states ind...