A 2n-2 Step Algorithm for Routing in an n*n Array with Constant-Size Queues.
Frank Thomson LeightonFillia MakedonIoannis G. TollisPublished in: Algorithmica (1995)
Keyphrases
- preprocessing
- detection algorithm
- experimental evaluation
- computational complexity
- dynamic programming
- learning algorithm
- multi step
- expectation maximization
- scales linearly
- search space
- np hard
- matching algorithm
- computational cost
- high accuracy
- cost function
- k means
- memory requirements
- recognition algorithm
- fixed size
- routing decisions
- space requirements
- segmentation algorithm
- linear programming
- worst case