Parallel exhaustive search without coordination.
Pierre FraigniaudAmos KormanYoav RodehPublished in: STOC (2016)
Keyphrases
- exhaustive search
- computational complexity
- computationally feasible
- solution space
- brute force
- search methods
- search space
- dynamic programming
- multi agent
- multiagent systems
- nearest neighbor search
- simulated annealing
- lower bound
- cost function
- parallel processing
- multi agent reinforcement learning
- information sharing
- neural network
- multi agent systems
- optimal solution
- parallel computing
- multiple agents
- multi objective
- parallel execution
- multi agent coordination