A Logarithmic Boolean Time Algorithm for Parallel Polynomial Division.
Dario BiniVictor Y. PanPublished in: Aegean Workshop on Computing (1986)
Keyphrases
- worst case
- learning algorithm
- experimental evaluation
- dynamic programming
- parallel implementation
- optimization algorithm
- objective function
- improved algorithm
- detection algorithm
- computational cost
- search space
- cost function
- k means
- segmentation algorithm
- computational complexity
- multi objective
- np hard
- theoretical analysis
- optimal solution
- times faster
- recognition algorithm
- polynomially bounded
- parallel version
- parallel machines
- parallel processing
- matching algorithm
- preprocessing
- expectation maximization
- scheduling problem