Home | deutsch  | Legals | Data Protection | Sitemap | KIT

Finding Optimal Longest Paths by Dynamic Programming in Parallel

Finding Optimal Longest Paths by Dynamic Programming in Parallel
Conference:

12th Annual Symposium on Combinatorial Search (SoCS)

Links:Slides
Location:

Napa, CA, USA

Date:

July 2019

Author(s):

Kai Fieger, Tomas Balyo, Christian Schulz, Dominik Schreiber

Speaker:

Dominik Schreiber