Login / Signup
An upper bound on the cycle time of a stochastic marked graph using incomplete information on the transition firing time distributions.
Gerrit K. Janssens
Kenneth Sörensen
Wout Dullaert
Published in:
Math. Comput. Model. (2009)
Keyphrases
</>
incomplete information
upper bound
lower bound
constant factor
partial information
autonomous agents
query answering
nash equilibria
graph structure
worst case
possibility theory
open world
missing information
repeated games
first order logic
probabilistic model
objective function
artificial intelligence