44 search results - page 3 / 9 » Bounding Rationality by Discounting Time |
FSTTCS
2005
Springer
14 years 4 months ago
2005
Springer
In this paper4 , we compare Timed Automata (TA) and Time Petri Nets (TPN) with respect to weak timed bisimilarity. It is already known that the class of bounded TPNs is strictly in...
LICS
2009
IEEE
14 years 5 months ago
2009
IEEE
This paper presents a new lower bound for the discrete strategy improvement algorithm for solving parity games due to V¨oge and Jurdzi´nski. First, we informally show which stru...
CP
2007
Springer
14 years 5 months ago
2007
Springer
Deviation is a recent constraint to balance a set of variables with respect to a given mean. We show that the propagators recently introduced are not bound-consistent when the mean...
CORR
2011
Springer
13 years 5 months ago
2011
Springer
This paper investigates the time-bounded version of the reachability problem for hybrid automata. This problem asks whether a given hybrid automaton can reach a given target locat...
EOR
2008
13 years 11 months ago
2008
We solve an optimal growth model in continuous space, continuous and bounded time. The optimizer chooses the optimal trajectories of capital and consumption across space and time ...