804 search results - page 90 / 161 » On the Termination of the Chase Algorithm |
113
click to vote
CORR
2006
Springer
15 years 19 days ago
2006
Springer
In this paper, we present a Byzantine fault tolerant distributed commit protocol for transactions running over untrusted networks. The traditional two-phase commit protocol is enh...
CORR
2007
Springer
15 years 17 days ago
2007
Springer
Efficiently computing fast paths in large-scale dynamic road networks (where dynamic traffic information is known over a part of the network) is a practical problem faced by sever...
93
Voted
PPL
2008
15 years 16 days ago
2008
Algorithmic skeletons intend to simplify parallel programming by providing a higher abstraction compared to the usual message passing. Task and data parallel skeletons can be dist...
104
click to vote
TASE
2008
IEEE
15 years 15 days ago
2008
IEEE
Soon after the birth of the flourishing research area of model checking in the early eighties, researchers started to apply this technique to finite automata equipped with probabi...
103
click to vote
TCS
2008
15 years 15 days ago
2008
Analysis of Distributed Abstract Machines Damien Pous ENS Lyon, France. We illustrate the use of recently developed proof techniques for weak bisimulation sing a generic framework...