Proving a Non-blocking Algorithm for Process Renaming with TLA ^+ +.
Aurélie HuraultPhilippe QuéinnecPublished in: TAP@FM (2019)
Keyphrases
- computational complexity
- learning algorithm
- dynamic programming
- preprocessing
- single pass
- times faster
- optimization algorithm
- worst case
- significant improvement
- data sets
- experimental study
- high accuracy
- computational cost
- k means
- np hard
- experimental evaluation
- matching process
- computationally efficient
- theoretical analysis
- similarity measure
- cost function
- matching algorithm
- classification algorithm
- optimization process
- hardware implementation
- improved algorithm
- selection algorithm
- recognition algorithm
- image processing
- path planning
- simulated annealing
- objective function
- support vector machine
- optimal solution