Making Self-Stabilizing Algorithms for Any Locally Greedy Problem.
Johanne CohenLaurence PilardMikaël RabieJonas SénizerguesPublished in: SAND (2023)
Keyphrases
- orders of magnitude
- computationally expensive
- hill climbing
- data structure
- greedy algorithm
- data mining techniques
- worst case
- greedy algorithms
- times faster
- computational efficiency
- computationally efficient
- database
- state space
- probabilistic model
- dynamic programming
- information systems
- real time
- theoretical analysis
- reinforcement learning
- image segmentation
- case study
- decision trees
- computer vision
- stochastic search