A self-stabilizing algorithm for constructing a minimal reachable directed acyclic graph with two senders and two targets.
Yonghwan KimMasahiro ShibataYuichi SudoJunya NakamuraYoshiaki KatayamaToshimitsu MasuzawaPublished in: Theor. Comput. Sci. (2021)
Keyphrases
- directed acyclic graph
- learning algorithm
- np hard
- preprocessing
- target tracking
- probabilistic model
- matching algorithm
- detection algorithm
- shortest path problem
- cost function
- dynamic programming
- particle swarm optimization
- rough sets
- transitive closure
- segmentation algorithm
- expectation maximization
- k means
- search space
- computational complexity
- optimal solution