Searching for "Termination is Timing." – sorted by Relevance.
-
Termination in Timed Process Algebra
- Termination in Timed Process Algebra J.C.M. Baeten M.A. Reniers Department of Mathematics
- Cited by 155 (25 self) – Add To MetaCart
-
The Recombinant History Apparatus Presents: Terminal Time
- The Recombinant History Apparatus Presents: Terminal Time Introduction Steffi Domike Communication
- Cited by 8 (4 self) – Add To MetaCart
-
Reniers. Timed process algebra (with a focus on explicit termination and relative-timing
- Timed Process Algebra (with a Focus on Explicit Termination and Relative-Timing) J.C.M. Baeten
- Cited by 3 (1 self) – Add To MetaCart
-
Timing the untimed: Terminating successfully while being conservative
- Timing the Untimed: Terminating Successfully while Being Conservative J. C. M. Baeten, M
- Cited by 3 (0 self) – Add To MetaCart
-
Feasible reactivity for synchronous cooperative threads
- develop static analysis methods to guarantee that each instant terminates in time polynomial in the size
- Cited by 5 (0 self) – Add To MetaCart
-
Reasoning about real-time repetitions: Terminating and nonterminating
- Reasoning about Real-Time Repetitions: Terminating and Nonterminating Abstract Ian Hayes School
- Cited by 1 (0 self) – Add To MetaCart
-
On the Analysis of Stochastic Divide and Conquer Algorithms.
- algorithm on a lower level. After a finite time the algorithm terminates. The termination time may depend
- Cited by 34 (1 self) – Add To MetaCart
-
Stochastic Partial Differential Equations With a Quasi-Periodic Boundary Condition
- quasiperiodic boundary condition which connects the solution at initial time and at terminal time. For a special
- Add To MetaCart
-
Impact of a Failure Detection Mechanism on the Performance of Consensus
- detectors, and analyze the impact on its termination time of various implementations of failure detectors
- Cited by 11 (6 self) – Add To MetaCart
-
Dynamic programming for minimum Steiner trees
- the minimum Steiner tree problem on graphs with k terminals in time O ∗ (c k ) for any c > 2. This improves
- Cited by 3 (1 self) – Add To MetaCart

