Parallel N-ary Speculative Computation of Simulated Annealing

Keyphrases

• Simulated Annealing 100%
• Speculative Computation 100%
• Massively Parallel 66%
• Real-world Problems 33%
• Effective Method 33%
• Computational Approach 33%
• Problem Size 33%
• Multiprocessor 33%
• Distributed Memory multiprocessors 33%
• Execution Time 33%
• Combinatorial Optimization Problem 33%
• Traveling Salesman Problem 33%
• Parallel Simulated Annealing 33%
• AP1000 33%

Computer Science

• Simulated Annealing 100%
• multi-processor 25%
• Distributed Memory (Multiprocessor) 25%
• Execution Time 25%
• Traveling Salesman Problem 25%
• Effective Method 25%
• Combinatorial Optimization Problem 25%
• Execution Result 25%