An Approximate Algorithm for DCOP with Optimal Solution Attainment Rate of 0.99.
Yasuki IizukaPublished in: SNPD (2012)
Keyphrases
- optimal solution
- cost function
- np hard
- matching algorithm
- preprocessing
- dynamic programming
- high accuracy
- objective function
- detection algorithm
- computational cost
- linear programming
- expectation maximization
- search space
- computational complexity
- probabilistic model
- optimal or near optimal
- exact solution
- global optimum
- recognition algorithm
- knapsack problem
- genetic algorithm
- worst case
- experimental evaluation
- mathematical model
- search algorithm
- linear program
- combinatorial optimization
- convergence rate
- solution quality
- simulated annealing
- significant improvement
- approximate solutions
- initial solution
- greedy heuristic