Amphithéâtre Maurice Halbwachs, Site Marcelin Berthelot
Open to all, subject to availability
-
The seminar by J.C. Latombe introduces the notion of probabilistic completeness, develops the associated algorithms and illustrates their performance.
Speaker(s)
Jean-Claude Latombe
Professor, Stanford University