Time and Space Optimality of Distributed Depth-First Token Circulation Algorithms.
Franck PetitVincent VillainPublished in: WDAS (1999)
Keyphrases
- data structure
- times faster
- computationally efficient
- learning algorithm
- search space
- exhaustive search
- low dimensional
- distributed constraint optimization problems
- neural network
- depth first search
- space requirements
- data mining techniques
- graphical models
- computational cost
- significant improvement
- search algorithm
- cooperative
- bayesian networks