93 search results - page 9 / 19 » Dependency-Based Action Refinement |
ACS
2006
13 years 7 months ago
2006
We give a coring version for the duality theorem for actions and coactions of a finitely generated projective Hopf algebra. We also provide a coring analogue for a theorem of H.-J....
ML
2006
ACM
13 years 7 months ago
2006
ACM
Bridge bidding is considered to be one of the most difficult problems for game-playing programs. It involves four agents rather than two, including a cooperative agent. In additio...
AGENTS
1999
Springer
13 years 11 months ago
1999
Springer
Uncertain and complex environments demand that an agent be able to anticipate the actions of others in order to avoid resource conflicts with them and to realize its goals. Confli...
ECP
1997
Springer
13 years 11 months ago
1997
Springer
We provide a reconstruction of Blum and Furst’s Graphplan algorithm, and use the reconstruction to extend and improve the original algorithm in several ways. In our reconstructi...
IUI
2003
ACM
14 years 22 days ago
2003
ACM
Interactive tools to help users author plans or processes are essential in a variety of domains. KANAL helps users author sound plans by simulating them, checking for a variety of...