An Algorithm with Optimal Failure Locality for the Dining Philosophers Problem.
Yih-Kuen TsayRajive L. BagrodiaPublished in: WDAG (1994)
Keyphrases
- optimal solution
- dynamic programming
- worst case
- detection algorithm
- computational complexity
- learning algorithm
- significant improvement
- improved algorithm
- times faster
- experimental evaluation
- recognition algorithm
- data sets
- memory requirements
- optimization algorithm
- search space
- exhaustive search
- space complexity
- closed form
- segmentation algorithm
- ant colony optimization
- globally optimal
- tree structure
- theoretical analysis
- linear programming
- simulated annealing
- state space
- np hard
- cost function
- search algorithm
- image sequences