Login / Signup

Efficient CGM-based parallel algorithms for the longest common subsequence problem with multiple substring-exclusion constraints.

Vianney Kengne TchendjiArmel Nkonjoh NgomadeJerry Lacmou ZeutouoJean Frédéric Myoupo
Published in: Parallel Comput. (2020)
Keyphrases
  • parallel algorithm
  • shared memory
  • parallel computation
  • pc cluster
  • beam search
  • parallel programming
  • reinforcement learning
  • optimal solution
  • constraint satisfaction
  • combinatorial search problems