Events in September–October 2017
MonMonday | TueTuesday | WedWednesday | ThuThursday | FriFriday | SatSaturday | SunSunday |
---|---|---|---|---|---|---|
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 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) – 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) – 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) – 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 |
October 2, 2017
|
October 3, 2017
|
October 4, 2017
|
October 5, 2017(1 event) Keynote LIG – |
October 6, 2017
|
October 7, 2017
|
October 8, 2017
|
October 9, 2017(1 event) Seminar Takai Kennouche : LTE/WiFi Coexistence: a WiFi interference-evasion approach – LTE/WiFi Coexistence: a WiFi interference-evasion approach Abstract Bâtiment IMAG (442) |
October 10, 2017
|
October 11, 2017(1 event) Thematic day: Optimizing Data Move-ments – *9:30—10:45*: courts exposés & discussions - Louis-Claude CANON (ROMA, Inria): - Grégory MOUNIÉ (LIG, Univ. Grenoble Alpes): *10:45—11:00*: pause *11:00—12:30*: courts exposés & discussions - Lionel EYRAUD-DUBOIS (LaBRI, Inria): - Alix MUNIER (LIP6, UPMC): *14:00—16:00*: soutenance de thèse - Raphaël BLEUSE (LIG, Univ. Grenoble Alpes): |
October 12, 2017(1 event) "Fête de la science" – |
October 13, 2017
|
October 14, 2017
|
October 15, 2017
|
October 16, 2017
|
October 17, 2017
|
October 18, 2017
|
October 19, 2017(1 event) Asymptotic Studies of Large Distributed systems with Failures by Philippe Robert (Inria, Paris) – Asymptotic Studies of Large Distributed systems with Failures The qualitative behavior of a large scale storage network of non reliable file servers is investigated. In such systems a fraction of the processing capacity can be used to duplicate files on new servers when necessary. Due to random losses, with probability 1 all files will be lost eventually if no new files are added. The main question in this context is of understanding the relation between the durability of the system and the parameters of the network: the duplication capacity, the failure rate, the duplication factor and the average load of a node. Different scalings via mean-field limits or stochastic averaging can be used to study the eventual decay of these networks. They will be reviewed and discussed. An analysis of placement algorithms will be also presented. Bâtiment IMAG (442) |
October 20, 2017
|
October 21, 2017
|
October 22, 2017
|
October 23, 2017
|
October 24, 2017
|
October 25, 2017
|
October 26, 2017(1 event) Association dans les réseaux WiFi, par Isabelle Guerin (Lyon) – Les déploiements de réseaux WiFi denses permettent à une station d’avoir le choix entre plusieurs points d’accès lors de la connexion au réseau WiFi, améliorant ainsi la couverture radio, la qualité des liens radio et facilitant la mobilité. En contrepartie, la densité des points d’accès peut générer plus d’interférences et de contention, ce qui peut amener à une baisse du débit global puisque ces points d’accès doivent partager un nombre limité de canaux. Le retour à une gestion centralisée des réseaux WiFi offre l’opportunité d’une optimisation globale de l’usage de la ressource radio et donc de réduire les problèmes soulevés lors d’un partage intensif de cette dernière. Bâtiment IMAG (442) |
October 27, 2017
|
October 28, 2017
|
October 29, 2017
|
October 30, 2017
|
October 31, 2017
|
NovemberNovember 1, 2017 |
November 2, 2017
|
November 3, 2017
|
November 4, 2017
|
November 5, 2017
|