Overcoming the No Free Lunch Theorem in Cut-off Algorithms for Fork-Join programs.

Alcides Fonseca Bruno Cabral

Published in: Parallel Comput. (2018)

Keyphrases

learning algorithm
significant improvement
computational cost
worst case
orders of magnitude
computationally efficient
databases
genetic algorithm
computational complexity
optimization problems
main memory
efficient implementation
von neumann
sort merge