328 search results - page 8 / 66 » Simple Termination Revisited |
OTM
2009
Springer
14 years 2 months ago
2009
Springer
When automating work, it is often desirable to compensate completed work by undoing the work done by one or more activities. In the context of workflow, where compensation actions...
RTA
2010
Springer
13 years 11 months ago
2010
Springer
Infinitary Term Rewriting allows to express infinitary terms and infinitary reductions that converge to them. As their notion of transfinite reduction in general, and as binary...
NETCOOP
2009
Springer
14 years 2 months ago
2009
Springer
This paper revisits the two-hop forwarding policy in delay tolerant networks (DTNs) using simple probabilistic arguments. Closed form expressions are derived for the main performan...
TABLEAUX
2009
Springer
14 years 2 months ago
2009
Springer
We present a terminating tableau calculus for graded hybrid logic with global modalities, reflexivity, transitivity and role hierarchies. Termination of the system is achieved thr...
ISHPC
2000
Springer
13 years 11 months ago
2000
Springer
Deeply pipelined high performance processors require highly accurate branch prediction to drive their instruction fetch. However there remains a class of events which are not easi...