Sign in
On the computational complexity of some problems arising in partially-observed discrete-event systems.
Tae-Sic Yoo
Stéphane Lafortune
Published in:
ACC (2001)
Keyphrases
</>
discrete event systems
partially observed
computational complexity
np complete
search algorithm
decision problems
high computational complexity
objective function
multi agent systems
optimization problems
bit rate
memory requirements
failure diagnosis