Distributed Gibbs: a memory-bounded sampling-based DCOP algorithm.
Duc Thien NguyenWilliam YeohHoong Chuin LauPublished in: AAMAS (2013)
Keyphrases
- monte carlo
- computational complexity
- dynamic programming
- experimental evaluation
- k means
- objective function
- search space
- memory space
- matching algorithm
- convergence rate
- particle swarm optimization
- optimization algorithm
- path planning
- linear programming
- probabilistic model
- space complexity
- computational efficiency
- memory usage
- bounded memory
- parameter estimation
- segmentation algorithm
- computationally efficient
- expectation maximization
- simulated annealing
- worst case
- computational cost
- np hard
- preprocessing