Login / Signup

A Polynomial-Time Algorithm for Solving the Minimal Observability Problem in Conjunctive Boolean Networks.

Eyal WeissMichael Margaliot
Published in: IEEE Trans. Autom. Control. (2019)
Keyphrases
  • worst case
  • learning algorithm
  • np hard
  • dynamic programming
  • neural network
  • k means
  • expectation maximization
  • data sets
  • data analysis
  • maximum likelihood