19 search results - page 2 / 4 » Strong Controllability of Disjunctive Temporal Problems with... |
PLDI
2010
ACM
14 years 2 months ago
2010
ACM
We define the reachability-bound problem to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in ...
IJCAI
2003
13 years 6 months ago
2003
Temporal Constraint Satisfaction Problems allow for reasoning with events happening over time. Their expressiveness has been extended independently in two directions: to account f...
AAAI
2007
13 years 7 months ago
2007
We explore a means to both model and reason about partial observability within the scope of constraintbased temporal reasoning. Prior studies of uncertainty in Temporal CSPs have ...
AIPS
2009
13 years 6 months ago
2009
Dynamic plan execution strategies allow an autonomous agent to respond to uncertainties while improving robustness and reducing the need for an overly conservative plan. Executive...
CDC
2010
IEEE
13 years 15 days ago
2010
IEEE
Abstract-- In this paper, we consider the distributed computation of equilibria arising in monotone stochastic Nash games over continuous strategy sets. Such games arise in setting...