An Efficient Hybrid P2P Approach for Non-redundant Tree Exploration in B&B Algorithms.
Malika MehdiMohand-Said MezmazNouredine MelabEl-Ghazali TalbiPascal BouvryPublished in: CISIS (2008)
Keyphrases
- learning algorithm
- recently developed
- graph theory
- orders of magnitude
- data mining
- data sets
- bayesian networks
- computational complexity
- computational cost
- theoretical analysis
- tree search
- minimum spanning tree
- memory requirements
- benchmark datasets
- computationally efficient
- peer to peer
- significant improvement
- data structure
- machine learning