Sequential Proximity - Towards Provably Scalable Concurrent Search Algorithms.
Karolos AntoniadisRachid GuerraouiJulien StainerVasileios TrigonakisPublished in: NETYS (2017)
Keyphrases
- search algorithm
- parallel tree search
- dead end
- lightweight
- heuristic search
- search problems
- sequential search
- graph search
- tree search
- worst case
- search space
- branch and bound
- hill climbing
- sequential data
- data sets
- path finding
- memory efficient
- heuristic search algorithms
- motion estimation
- mutual exclusion
- hidden markov models
- concurrent programs
- gestalt laws
- information systems