MonMonday | TueTuesday | WedWednesday | ThuThursday | FriFriday | SatSaturday | SunSunday |
---|---|---|---|---|---|---|
July 31, 2017
|
AugustAugust 1, 2017 |
August 2, 2017
|
August 3, 2017
|
August 4, 2017
|
August 5, 2017
|
August 6, 2017
|
August 7, 2017
|
August 8, 2017
|
August 9, 2017
|
August 10, 2017
|
August 11, 2017
|
August 12, 2017
|
August 13, 2017
|
August 14, 2017
|
August 15, 2017
|
August 16, 2017
|
August 17, 2017
|
August 18, 2017
|
August 19, 2017
|
August 20, 2017
|
August 21, 2017
|
August 22, 2017
|
August 23, 2017
|
August 24, 2017
|
August 25, 2017
|
August 26, 2017
|
August 27, 2017
|
August 28, 2017
|
August 29, 2017
|
August 30, 2017
|
August 31, 2017
|
SeptemberSeptember 1, 2017 |
September 2, 2017
|
September 3, 2017
|
September 4, 2017
|
September 5, 2017
|
September 6, 2017
|
September 7, 2017(1 event)
keynote LIGkeynote LIG – |
September 8, 2017
|
September 9, 2017
|
September 10, 2017
|
September 11, 2017
|
September 12, 2017
|
September 13, 2017
|
September 14, 2017(1 event)
Computing with coins (by Jean-Marc Vincent)Computing with coins (by Jean-Marc Vincent) – The Head and tail random process appears, since the beginning of the art of computation, as a fundamental part of computer science. This talk will explore at a very basic level several ideas about computation of numbers, evaluation of quantities, checking techniques or recommendation evaluation. By small examples, we’ll try to establish links through ages between the probabilistic and algorithmic thinking. Bâtiment IMAG (442) |
September 15, 2017
|
September 16, 2017
|
September 17, 2017
|
September 18, 2017
|
September 19, 2017
|
September 20, 2017
|
September 21, 2017(1 event)
Kleinberg 's Grid Unchained (by Fabien Mathieu, Nokia)Kleinberg 's Grid Unchained (by Fabien Mathieu, Nokia) – One of the key features of small-worlds is the ability to route messages with few hops only using local knowledge of the topology. In 2000, Kleinberg proposed a model based on an augmented grid that asymptotically exhibits such property. In this paper, we propose to revisit the original model from a simulation-based perspective. Our approach is fueled by a new algorithm that can draw an augmenting link in Õ(1). The resulting speed gain enables detailed numerical evaluations. We show for example that in practice, the augmented scheme proposed by Kleinberg is more robust than predicted by the asymptotic behavior, even for very large finite grids. We also propose tighter bounds on the performance of Kleinberg's routing algorithm. At last, we show that, fed with realistic parameters, the model gives results in line with real-life experiments. Bâtiment IMAG (442) |
September 22, 2017
|
September 23, 2017
|
September 24, 2017
|
September 25, 2017
|
September 26, 2017
|
September 27, 2017
|
September 28, 2017(1 event)
On-line speed scaling minimizing expected energy consumption for real-time tasks, by Stephan Plassart (Polaris)On-line speed scaling minimizing expected energy consumption for real-time tasks, by Stephan Plassart (Polaris) – We present a Markov Decision Process (MDP) approach to compute the optimal on-line speed scaling policy to minimize the energy consumption of a processor executing a finite or infinite set of jobs with real-time constraints. The policy is computed off-line but used on-line. We provide several qualitative properties of the optimal policy: monotonicity with respect to the jobs parameters, comparison with on-line deterministic algorithms. Numerical experiments show that our proposition performs well when compared with off-line optimal solutions and out-performs on-line solutions oblivious to statistical information on the jobs. Bâtiment IMAG (442) |
September 29, 2017
|
September 30, 2017
|
OctoberOctober 1, 2017 |