| MonMonday | TueTuesday | WedWednesday | ThuThursday | FriFriday | SatSaturday | SunSunday |
|---|---|---|---|---|---|---|
Sep 4, '17September 4, 2017
|
Sep 5, '17September 5, 2017
|
Sep 6, '17September 6, 2017
|
Sep 7, '17September 7, 2017●(1 event)
|
Sep 8, '17September 8, 2017
|
Sep 9, '17September 9, 2017
|
Sep 10, '17September 10, 2017
|
| MMonday | TTuesday | WWednesday | TThursday | FFriday | SSaturday | SSunday |
|---|---|---|---|---|---|---|
28August 28, 2017
|
29August 29, 2017
|
30August 30, 2017
|
31August 31, 2017
|
September1September 1, 2017 |
2September 2, 2017
|
3September 3, 2017
|
4September 4, 2017
|
5September 5, 2017
|
6September 6, 2017
|
keynote LIG – |
8September 8, 2017
|
9September 9, 2017
|
10September 10, 2017
|
11September 11, 2017
|
12September 12, 2017
|
13September 13, 2017
|
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) |
15September 15, 2017
|
16September 16, 2017
|
17September 17, 2017
|
18September 18, 2017
|
19September 19, 2017
|
20September 20, 2017
|
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) |
22September 22, 2017
|
23September 23, 2017
|
24September 24, 2017
|
25September 25, 2017
|
26September 26, 2017
|
27September 27, 2017
|
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) |
29September 29, 2017
|
30September 30, 2017
|
October1October 1, 2017 |
2October 2, 2017
|
3October 3, 2017
|
4October 4, 2017
|
Keynote LIG – |
6October 6, 2017
|
7October 7, 2017
|
8October 8, 2017
|
Seminar Takai Kennouche : LTE/WiFi Coexistence: a WiFi interference-evasion approach – LTE/WiFi Coexistence: a WiFi interference-evasion approach Abstract Bâtiment IMAG (442) |
10October 10, 2017
|
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): |
"Fête de la science" – |
13October 13, 2017
|
14October 14, 2017
|
15October 15, 2017
|
16October 16, 2017
|
17October 17, 2017
|
18October 18, 2017
|
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) |
20October 20, 2017
|
21October 21, 2017
|
22October 22, 2017
|
23October 23, 2017
|
24October 24, 2017
|
25October 25, 2017
|
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) |
27October 27, 2017
|
28October 28, 2017
|
29October 29, 2017
|
30October 30, 2017
|
31October 31, 2017
|
November1November 1, 2017 |
2November 2, 2017
|
3November 3, 2017
|
4November 4, 2017
|
5November 5, 2017
|
This website uses cookies so that we can provide you with the best user experience possible. Cookie information is stored in your browser and performs functions such as recognising you when you return to our website and helping our team to understand which sections of the website you find most interesting and useful.
Strictly Necessary Cookie should be enabled at all times so that we can save your preferences for cookie settings.
If you disable this cookie, we will not be able to save your preferences. This means that every time you visit this website you will need to enable or disable cookies again.
