Home | english  | Impressum | Datenschutz | Sitemap | KIT

Finding Optimal Longest Paths by Dynamic Programming in Parallel

Finding Optimal Longest Paths by Dynamic Programming in Parallel
Tagung:

12th Annual Symposium on Combinatorial Search (SoCS)

Links:Folien
Tagungsort:

Napa, CA, USA

Datum:

Juli 2019

Autoren:

Kai Fieger, Tomas Balyo, Christian Schulz, Dominik Schreiber

Referent:

Dominik Schreiber