804 search results - page 21 / 161 » On the Termination of the Chase Algorithm |
ENTCS
2008
14 years 10 months ago
2008
We describe a method for proving the termination of graph transformation systems. The method is based on the fact that infinite reductions must include infinite `creation chains&#...
ISPDC
2006
IEEE
15 years 4 months ago
2006
IEEE
Optimistically Terminating Consensus (OTC) is a variant of Consensus that decides if all correct processes propose the same value. It is surprisingly easy to implement: processes ...
63
Voted
MICRO
2000
IEEE
14 years 10 months ago
2000
IEEE
dards, language abstraction continues unabatrpretation of such high-level abstract languages requires high performance. The MP98 low-power, high-performance microprocessor architec...
CDC
2010
IEEE
14 years 5 months ago
2010
IEEE
FAA's NextGen program aims at increasing the capacity of the national airspace, while ensuring the safety of aircraft. This paper provides a distributed merging and spacing al...
104
click to vote
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Contrary to the sequential world, the processes involved in a distributed system do not necessarily know when a computation is globally finished. This paper investigates the proble...