Abstract: Boolean satisfiability (SAT), a non-deterministic polynomial (NP)-complete problem, has gained increasing attention with applications in artificial intelligence, machine learning, electronic ...
Abstract: This article investigates the pinning asymptotic stabilization of probabilistic Boolean networks (PBNs) by a digraph approach. In order to stabilize the PBN asymptotically, a ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results