Bit-Parallel Algorithms for the Merged Longest Common Subsequence Problem.
Sebastian DeorowiczAgnieszka DanekPublished in: Int. J. Found. Comput. Sci. (2013)
Keyphrases
- parallel algorithm
- beam search
- parallel computation
- branch and bound
- heuristic search
- shared memory
- cluster of workstations
- search problems
- search algorithm
- parallel version
- search methods
- parallel programming
- pc cluster
- parallel implementations
- hill climbing
- ranking functions
- processor array
- combinatorial search problems
- orders of magnitude
- evolutionary algorithm
- lower bound