Sciweavers

127 search results - page 3 / 26
» Graph Based Representation of Dynamic Planning
Sort
View
WG
2005
Springer
14 years 1 months ago
Fully Dynamic Algorithm for Recognition and Modular Decomposition of Permutation Graphs
This paper considers the problem of maintaining a compact representation (O(n) space) of permutation graphs under vertex and edge modifications (insertion or deletion). That repr...
Christophe Crespelle, Christophe Paul
AIPS
2011
12 years 11 months ago
Visual Programming of Plan Dynamics Using Constraints and Landmarks
In recent years, there has been considerable interest in the use of planning techniques in new media and computer games. Many traditional planning notions no longer apply in the c...
Julie Porteous, Jonathan Teutenberg, David Pizzi, ...
AI
2000
Springer
13 years 7 months ago
Stochastic dynamic programming with factored representations
Markov decisionprocesses(MDPs) haveproven to be popular models for decision-theoretic planning, but standard dynamic programming algorithms for solving MDPs rely on explicit, stat...
Craig Boutilier, Richard Dearden, Moisés Go...
AAMAS
2008
Springer
13 years 7 months ago
Dynamic intention structures I: a theory of intention representation
This article introduces a new theory of intention representation which is based1 on a structure called a Dynamic Intention Structure (DIS). The theory of DISs was motivated2 by the...
Luke Hunsberger, Charles L. Ortiz Jr.
BIRTHDAY
2008
Springer
13 years 9 months ago
Graph-Based Design and Analysis of Dynamic Software Architectures
We illustrate two ways to address the specification, modelling and analysis of dynamic software architectures using: i) ordinary typed graph transformation techniques implemented i...
Roberto Bruni, Antonio Bucchiarone, Stefania Gnesi...