A Self-Stabilizing Algorithm for Constructing (1, 1)-Maximal Directed Acyclic Graph.
Yonghwan KimHaruka OhnoYoshiaki KatayamaToshimitsu MasuzawaPublished in: IPDPS Workshops (2017)
Keyphrases
- directed acyclic graph
- search space
- dynamic programming
- equivalence class
- detection algorithm
- segmentation algorithm
- computational cost
- preprocessing
- np hard
- bayesian network structure
- learning algorithm
- shortest path problem
- worst case
- particle swarm optimization
- cost function
- optimization algorithm
- k means
- matching algorithm
- objective function
- similarity measure
- simulated annealing
- lower bound
- optimal solution