Sciweavers

312 search results - page 43 / 63
» On Temporal Planning as CSP
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
JAR
2000
129views more  JAR 2000»
13 years 7 months ago
Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems
We study the runtime distributions of backtrack procedures for propositional satisfiability and constraint satisfaction. Such procedures often exhibit a large variability in perfor...
Carla P. Gomes, Bart Selman, Nuno Crato, Henry A. ...
UIST
2003
ACM
14 years 24 days ago
Rhythm modeling, visualizations and applications
People use their awareness of others' temporal patterns to plan work activities and communication. This paper presents algorithms for programatically detecting and modeling t...
James Begole, John C. Tang, Rosco Hill
IJCAI
2007
13 years 9 months ago
Towards Reasoning about the Past in Neural-symbolic Systems
Reasoning about the past is of fundamental importance in several applications in computer science and artificial intelligence, including reactive systems and planning. In this pa...
Rafael V. Borges, Luís C. Lamb, Artur S. d'...
AIPS
2004
13 years 9 months ago
Incremental Maximum Flows for Fast Envelope Computation
Resource envelopes provide the tightest exact bounds on the resource consumption and production caused by all possible executions of a temporally flexible plan. We present a new c...
Nicola Muscettola