Upper bounds and algorithms for parallel knock-out numbers.
Hajo BroersmaMatthew JohnsonDaniël PaulusmaPublished in: Theor. Comput. Sci. (2009)
Keyphrases
- upper bound
- upper and lower bounds
- computational complexity
- lower bound
- significant improvement
- learning algorithm
- computational cost
- theoretical analysis
- orders of magnitude
- parallel hardware
- machine learning
- parallel implementations
- parallel architectures
- lower and upper bounds
- parallel computing
- knapsack problem
- data mining techniques
- optimization problems
- bayesian networks