Login / Signup
A correct-by-construction approach for proving distributed algorithms in spanning trees.
Faten Fakhfakh
Mohamed Tounsi
Mohamed Mosbah
Dominique Méry
Ahmed Hadj Kacem
Published in:
ICIS (2017)
Keyphrases
</>
spanning tree
cooperative
theoretical analysis
benchmark datasets
learning algorithm
significant improvement
computational cost
distributed systems
computationally efficient
orders of magnitude
times faster
data sets
evolutionary algorithm
dimensionality reduction
depth first search
distributed computation