Sciweavers

870 search results - page 116 / 174
» The failure detector abstraction
Sort
View
PCI
2001
Springer
14 years 1 months ago
Two-Phase Commit Processing with Restructured Commit Tree
Abstract. Extensive research has been carried out in search for an efcient atomic commit protocol and many optimizations have been suggested to improve the basic two-phase commit p...
George Samaras, George K. Kyrou, Panos K. Chrysant...
WDAG
2001
Springer
104views Algorithms» more  WDAG 2001»
14 years 1 months ago
A New Synchronous Lower Bound for Set Agreement
Abstract. We have a new proof of the lower bound that k-set agreement requires f/k + 1 rounds in a synchronous, message-passing model with f crash failures. The proof involves cons...
Maurice Herlihy, Sergio Rajsbaum, Mark R. Tuttle
ICLP
1994
Springer
14 years 1 months ago
Compiling Intensional Sets in CLP
Constructive negation has been proved to be a valid alternative to negation as failure, especially when negation is required to have, in a sense, an `active' role. In this pa...
Paola Bruscoli, Agostino Dovier, Enrico Pontelli, ...
PARLE
1992
14 years 1 months ago
Reliable Communication in VPL
We compare di erent degrees of architecture abstraction and communication reliability in distributed programming languages. A nearly architecture independent logic programming lang...
eva Kühn, Franz Puntigam
HRI
2007
ACM
14 years 29 days ago
HRI caught on film
The Human Robot Interaction 2007 conference hosted a video session, in which movies of interesting, important, illustrative, or humorous HRI research moments are shown. This paper...
Christoph Bartneck, Takayuki Kanda