Current teams : | ALMASTY ALSOC APR BD CIAN ComplexNetworks DECISION DELYS LFI MOCAH MoVe NPA PEQUAN PolSys QI RO SMA SYEL |
- I. Abdeljaoued‑Tej, A. Benkahla, Gh. Haddad, A. Valibouze : “A Linear Algorithm For Computing Polynomial Dynamical Systems”, [Abdeljaoued-Tej 2018a]
- Y. Amoussou‑Guenou, A. Del Pozzo, M. Potop‑Butucaru, S. Tucci‑Piergiovanni : “Correctness and Fairness of Tendermint-core Blockchains”, 1-29 pages [Amoussou-Guenou 2018b]
- Y. Amoussou‑Guenou, S. Baarir, M. Potop‑Butucaru, N. Sznajder, L. Tible, S. Tixeuil : “On the encoding and solving partial information games”, [Amoussou-Guenou 2018d]
- F. Anceau, D. Etiemble : “Processeurs superscalaires "flots de donnĂ©es"”, [Anceau 2018]
- Ph. Aubry, J. Marrez, A. Valibouze : “RĂ©solution rĂ©elle de systèmes polynomiaux flous”, [Aubry 2018]
- M.‑A. Baazizi, D. Colazzo, G. Ghelli, C. Sartiani : “Proofs for Parametric Schema Inference for Massive JSON Datasets”, [Baazizi 2018]
- Th. Balabonski, P. Courtieu, R. Pelle, L. Rieg, S. Tixeuil, X. Urbain : “Continuous vs. Discrete Asynchronous Moves: a Certified Approach for Mobile Robots”, 1-12 pages [Balabonski 2018b]
- F. BALBO, F. Berreby, O. Boissier, V. Bonnemains, G. Bonnet, G. Bourgne, P.‑A. Chardel, J.‑G. Ganascia, B. Mermet, G. Simon, Th. De Swarte, C. Tessier, R. Voyer : “Éthique et agents autonomes”, 49 pages [BALBO 2018]
- B. Barbot, B. BĂ©rard, Y. Duplouy, S. Haddad : “Integrating Simulink Models into the Model Checker Cosmos”, [Barbot 2018a]
- A. Blaise, M. Bouet, V. Conan, S. Secci : “DĂ©sanonymisation du jeu de donnĂ©es MAWI”, MISC : multi-system & internet security cookbook, (Edition Diamond) [Blaise 2018]
- S. Bonomi, G. Farina, S. Tixeuil : “Reliable Broadcast in Dynamic Networks with Locally Bounded Byzantine Failures”, [Bonomi 2018d]
- H.‑L. Botterman, C. Grasland, R. Lamarche‑Perrin, R. Leconte, M. Severo, É. Toureille : “The International Geomedia Agenda: ODYCCEUS Deliverable 1.3”, 55 p. pages [Botterman 2018]
- D. Bouhineau, V. Luengo, N. Mandran : “Concevoir, produire, dĂ©crire, Ă©valuer, amĂ©liorer, partager et conserver des donnĂ©es, opĂ©rateurs, processus d’analyse et rĂ©sultats d’études sur les logs d’activitĂ©s d’apprentissages humains avec ordinateur”, [Bouhineau 2018]
- M. Bournat, S. Dubois, F. Petit : “Gracefully Degrading Gathering in Dynamic Rings”, [Bournat 2018a]
- M. Chen, L. Denoyer, Th. Artières : “Multi-View Data Generation Without View Supervision”, [Chen 2018a]
- G. Contardo, L. Denoyer, Th. Artières : “A Meta-Learning Approach to One-Step Active Learning”, [Contardo 2018]
- M. Djoudi, V. Luengo, H. KechaĂŻ, J. François Cerisier, E. Maugard, F. Cherigny, O. Champalle, S. Iksal, P. Beust : “Learning Analytics : Notes de veille, partage et curation de ressources”, [Djoudi 2018a]
- M. Djoudi, V. Luengo, H. KechaĂŻ, J. François Cerisier, E. Maugard, F. Cherigny, O. Champalle, S. Iksal, P. Beust : “Learning Analytics : terminologie du Learning Analytics.”, [Djoudi 2018b]
- C. Doerr : “Optimisation InspirĂ©e par la Nature”, [Doerr 2018b]
- D. Foreback, M. Nesterenko, S. Tixeuil : “Churn Possibilities and Impossibilities”, [Foreback 2018]
- A. Jaszkiewicz, Th. Lust : “ND-Tree-based update: a Fast Algorithm for the Dynamic Non-Dominance Problem”, [Jaszkiewicz 2018a]
- A. Jean‑Marie, E. Hyon : “Optimal control of admission in service in a queue with impatience and setup costs”, 1-47 pages [Jean-Marie 2018]
- M. Lefevre, S. Iksal, J. Broisin, O. Champalle, V. Fontanieu, Ch. Michel, A. Yessad : “DNE - GTnum2 Learning Analytics - Etat de l’art sur les outils et mĂ©thodes issus de la recherche française”, [Lefevre 2018]
- F. Leichter‑Flack, J.‑G. Ganascia, Ph. Askenazy, P. DebrĂ©, C. Jeandel, M. Leduc, L. Letellier, A. MoliniĂ© : “COMETS AVIS 2018-37 - Quelles nouvelles responsabilitĂ©s pour les chercheurs Ă l’heure des dĂ©bats sur la post-vĂ©ritĂ©”, [Leichter-Flack 2018]
- E. Mauffret, É. Jeanneau, L. Arantes, P. Sens : “The Weakest Failure Detector to Solve the Mutual Exclusion Problem in an Unknown Dynamic Environment”, [Mauffret 2018]
- R. Monat : “Static Analysis by Abstract Interpretation Collecting Types of Python Programs”, [Monat 2018]
- P. Moyal, A. Busic, J. Mairesse : “Loynes construction for the extended bipartite matching”, [Moyal 2018]
- M. Munch, J. Dibie‑Barthelemy, C. Manfredotti, P.‑H. Wuillemin : “[WORK DOCUMENT] Towards interactive causal relation discovery driven by an ontology”, [Munch 2018a]
- S. Nair, M. Shapiro : “Improving the "Correct Eventual Consistency" Tool”, [Nair 2018]
- B. Ngom, M. Makpangou, S. Ndiaye : “SPT – Summary Prefix Tree: An over DHT Indexing Data Structure for Efficient Superset Search”, [Ngom 2018]
- F. Qureshi, A. Volkova, Th. Hilaire, J. Takala : “Multiplierless Processing Element for Non-Power-of-Two FFTs”, [Qureshi 2018]
- M. Shapiro, A. Bieniusa, N. Preguiça, V. Balegas, Ch. Meiklejohn : “Just-Right Consistency: reconciling availability and safety”, 1-15 pages [Shapiro 2018a]