C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
Approximating Optimal Bounds in Prompt-LTL Realizability in Doubly-exponential Time
Leander Tentrup
Alexander Weinert
Martin Zimmermann
Published in:
GandALF (2016)
Keyphrases
</>
worst case
dynamic programming
tight bounds
upper bound
search algorithm
lower bound
asymptotically optimal
closed form
optimal control
efficient computation
bounded model checking
machine learning
optimal cost
optimal design
evolutionary algorithm
optimal solution
multi agent
case study