222 search results - page 35 / 45 » On the Refinement of Atomic Actions |
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...
CIDR
2009
13 years 8 months ago
2009
Recent work has shown that we can dramatically improve the performance of computer games and simulations through declarative processing: Character AI can be written in an imperati...
AINA
2007
IEEE
13 years 7 months ago
2007
IEEE
The e-health domain has for objective to assist and manage citizens health. It concerns many actors like patient, doctors, hospitals and administration. Current and forthcoming ge...