286 search results - page 50 / 58 » A calculus of atomic actions |
COMPSAC
2004
IEEE
13 years 11 months ago
2004
IEEE
Web services (WS) received significant attention recently because services can be searched, bound, and executed at runtime over the Internet. This paper proposes a dynamic reconfi...
WDAG
1995
Springer
13 years 11 months ago
1995
Springer
This paper proposes a general definition of self-stabilizing wait-free shared memory objects. The definition ensures that, even in the face of processor failures, every executio...
AAAI
2006
13 years 9 months ago
2006
Even under polynomial restrictions on plan length, conformant planning remains a very hard computational problem as plan verification itself can take exponential time. This heavy ...
AIPS
2003
13 years 8 months ago
2003
There have been several proposals for expressing planning problems with different forms of uncertainty, including nondeterminism and partial observability. In this paper we invest...
OPODIS
2000
13 years 8 months ago
2000
We assume a link-register communication model under read/write atomicity, where every process can read from but cannot write into its neighbours' registers. The paper present...