210. Is maze-solving parallelizable?
Invited abstract in session WD-5: Optimization for learning II, stream Optimization for learning.
Wednesday, 11:25 - 12:40Room: M:N
Authors (first author is the speaker)
| 1. | Romain Cosson
|
| Inria |
Abstract
Can you find a short path, without a map? Is maze-solving parallelizable? These intriguing questions can be cast formally into the lens of competitive analysis: a versatile toolkit that has evolved since the 1990s and that has recently been invigorated by continuous optimization techniques. The talk will use these problems as a case study of the connections between online and distributed algorithms, and of the unsuspected role that convex optimization plays in modern approaches for competitive analysis. The talk will be based on published and ongoing works with co-authors. The two problems in the title are known as « layered graph traversal » (introduced by the literature on online algorithms) and « collective tree exploration » (introduced by the literature on distributed algorithms).
Keywords
- Artificial intelligence based optimization methods and appl
- Convex and non-smooth optimization
Status: accepted
Back to the list of papers