A distributed prime sieving algorithm based on Scheduling by Multiple Edge Reversal.
Gabriel PaillardChristian LavaultFelipe Maia Galvão FrançaPublished in: CoRR (2013)
Keyphrases
- dynamic programming
- learning algorithm
- computational complexity
- objective function
- preprocessing
- k means
- similarity measure
- recognition algorithm
- detection algorithm
- optimization algorithm
- simulated annealing
- worst case
- computational cost
- significant improvement
- search space
- probabilistic model
- high accuracy
- cost function
- linear programming
- scheduling algorithm
- undirected graph
- scheduling strategy
- particle swarm optimization
- graph cuts
- segmentation algorithm
- multi agent