Sciweavers

104 search results - page 9 / 21
» HTN Planning: Complexity and Expressivity
Sort
View
ATAL
2010
Springer
13 years 8 months ago
Point-based backup for decentralized POMDPs: complexity and new algorithms
Decentralized POMDPs provide an expressive framework for sequential multi-agent decision making. Despite their high complexity, there has been significant progress in scaling up e...
Akshat Kumar, Shlomo Zilberstein
SSDBM
2007
IEEE
121views Database» more  SSDBM 2007»
14 years 1 months ago
Cost-based Optimization of Complex Scientific Queries
High energy physics scientists analyze large amounts of data looking for interesting events when particles collide. These analyses are easily expressed using complex queries that ...
Ruslan Fomkin, Tore Risch
ATAL
2009
Springer
14 years 1 months ago
Using rituals to express cultural differences in synthetic characters
There is currently an ongoing demand for richer Intelligent Virtual Environments (IVEs) populated with social intelligent agents. As a result, many agent architectures are taking ...
Samuel Mascarenhas, João Dias, Nuno Afonso,...
CLIMA
2004
13 years 8 months ago
Symbolic Negotiation with Linear Logic
Abstract. Negotiation over resources and multi-agent planning are important issues in multi-agent systems research. It has been demonstrated [19] how symbolic negotiation and distr...
Peep Küngas, Mihhail Matskin
CADE
2005
Springer
14 years 7 months ago
Proof Planning for First-Order Temporal Logic
Proof planning is an automated reasoning technique which improves proof search by raising it to a meta-level. In this paper we apply proof planning to First-Order Linear Temporal L...
Claudio Castellini, Alan Smaill