Applying a Path-Compression technique to Obtain an Efficient Distributed Mutual Exclusion Algorithm.
José M. Bernabéu-AubánMustaque AhamadPublished in: WDAG (1989)
Keyphrases
- computational complexity
- expectation maximization
- mutual exclusion
- optimal path
- worst case
- dynamic programming
- k means
- general purpose
- image segmentation
- search space
- similarity measure
- preprocessing
- learning algorithm
- simulated annealing
- distributed systems
- cost function
- computationally efficient
- detection algorithm
- combinatorial optimization
- reinforcement learning
- multi robot
- data compression
- search strategy
- path planning
- image compression
- motion estimation
- probabilistic model
- np hard