216 search results - page 27 / 44 » The Complexity of Planning Problems With Simple Causal Graph... |
ACMACE
2005
ACM
14 years 1 months ago
2005
ACM
FreeWill+ is a framework that aims at integrating various animation techniques for controlling human-like characters. With heterogeneity and multi-layering as its main design prin...
ZUM
1997
Springer
13 years 12 months ago
1997
Springer
We present a new formal OO method, called FOX, which is a synergetic combination of the semi-formal Fusion method and the formal specification language Object-Z. To manage complex...
FSTTCS
2008
Springer
13 years 8 months ago
2008
Springer
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
STOC
2007
ACM
14 years 8 months ago
2007
ACM
We present a polynomial time approximation scheme (PTAS) for the minimum feedback arc set problem on tournaments. A simple weighted generalization gives a PTAS for KemenyYoung ran...
CP
2005
Springer
14 years 1 months ago
2005
Springer
Constrained path problems have to do with finding paths in graphs subject to constraints. One way of constraining the graph is by enforcing reachability on nodes. For instance, i...