Output Selection and Observer Design for Boolean Control Networks: A Sub-Optimal Polynomial-Complexity Algorithm.
Eyal WeissMichael MargaliotPublished in: IEEE Control. Syst. Lett. (2019)
Keyphrases
- worst case
- dynamic programming
- optimal solution
- computational complexity
- space complexity
- optimization algorithm
- preprocessing
- learning algorithm
- selection algorithm
- globally optimal
- optimal control
- network design
- computational cost
- convergence rate
- simulated annealing
- exhaustive search
- optimal parameters
- similarity measure
- input data
- linear programming
- objective function
- expectation maximization
- design process
- mathematical model
- memory requirements
- probabilistic model
- np hard
- k means
- user interface
- search space
- lower bound
- optimal strategy
- reinforcement learning
- increase in computational complexity