A Work-Optimal Deterministic Algorithm for the Certified Write-All Problem with a Nontrivial Number of Asynchronous Processors.
Grzegorz MalewiczPublished in: SIAM J. Comput. (2005)
Keyphrases
- dynamic programming
- computational complexity
- globally optimal
- optimal solution
- learning algorithm
- cost function
- randomized algorithm
- space complexity
- worst case
- times faster
- detection algorithm
- constant factor
- locally optimal
- execution times
- memory requirements
- simulated annealing
- significant improvement
- k means
- search space
- preprocessing
- objective function
- matching algorithm
- closed form
- particle swarm optimization
- hardware implementation
- parallel implementation
- competitive ratio
- similarity measure