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...
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, ...
Markov decisionprocesses(MDPs) haveproven to be popular models for decision-theoretic planning, but standard dynamic programming algorithms for solving MDPs rely on explicit, stat...
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...
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...