Showing 21 - 40 of 326

Zentralitätsmaßnahmen für die Evakuierung: so finden Sie agile Evakuierungsrouten ; Centrality measures for evacuation: Finding agile evacuation routes ; Medidas de centralidad para la evacuación. Cómo encontrar rutas de evacuación ágil ; Mesures de centralité pour l'évacuation: comment trouver des itinéraires d'évacuation agiles ; Misure di centralita per l'evacuazione. Come trovare percorsi di evacuazione agili
Lujak, Marin ; Giordani, Stefano ; Ecole nationale supérieure Mines-Télécom Lille Douai (IMT Lille Douai) ; et al.
ISSN: 0167-739X ; Future Generation Computer Systems ; https://hal.science/hal-01941692 ; Future Generation Computer Systems, 2018, 83, pp.401-412.

A Baby Step–Giant Step Roadmap Algorithm for General Algebraic Sets
Basu, Saugata ; Roy, Marie-Françoise ; Safey El Din, Mohab ; et al.
Foundations of Computational Mathematics. 14:1117-1172

On the Complexity of Computing Treebreadth
Ducoffe, Guillaume ; Legay, Sylvain ; Nisse, Nicolas ; et al.
27th International Workshop on Combinatorial Algorithms (IWOCA 2016)
27th International Workshop on Combinatorial Algorithms, IWOCA 2016
https://inria.hal.science/hal-01354996
27th International Workshop on Combinatorial Algorithms, IWOCA 2016, Aug 2016, Helsinki, Finland. pp.3-15, ⟨10.1007/978-3-319-44543-4_1⟩
http://iwoca2016.cs.helsinki.fi/

The Parallel Complexity of Coloring Games
Ducoffe, Guillaume ; Combinatorics, Optimization and Algorithms for Telecommunications (COATI) ; Centre Inria d'Université Côte d'Azur ; et al.
9th International Symposium, SAGT 2016
https://hal.science/hal-01361056
9th International Symposium, SAGT 2016, Sep 2016, Liverpool, United Kingdom. pp.27-39, ⟨10.1007/978-3-662-53354-3_3⟩
http://sagt16.csc.liv.ac.uk/

Online Non-preemptive Scheduling in a Resource Augmentation Model based on Duality
Lucarelli, Giorgio ; Kim Thang, Nguyen ; Srivastav, Abhinav ; et al.
LIPIcs ; European Symposium on Algorithms (ESA 2016) ; https://hal.univ-grenoble-alpes.fr/hal-01334219 ; European Symposium on Algorithms (ESA 2016), Aug 2016, Aarhus, Denmark. pp.1-17, ⟨10.4230/LIPIcs.ESA.2016.63⟩

A nearly optimal algorithm for deciding connectivity queries in smooth and bounded real algebraic sets
Safey El Din, Mohab ; Schost, Éric ; Polynomial Systems (PolSys) ; et al.
ISSN: 0004-5411.

Proper Hamiltonian Cycles in Edge-Colored Multigraphs
Águeda, Raquel ; Borozan, Valentin ; Díaz, Raquel ; et al.
ISSN: 0012-365X ; Discrete Mathematics ; https://hal.science/hal-01762563 ; Discrete Mathematics, 2017, 340 (8), pp.1897-1902. ⟨10.1016/j.disc.2017.03.013⟩.

Periodicity in optimal hierarchical checkpointing schemes for adjoint computations
Aupy, Guillaume ; Herrmann, Julien ; Topology-Aware System-Scale Data Management for High-Performance Computing (TADAAM) ; et al.
ISSN: 1055-6788.

The complexity of data aggregation in static and dynamic wireless sensor networks
Bramas, Quentin ; Tixeuil, Sébastien ; Networks and Performance Analysis (NPA) ; et al.
ISSN: 0890-5401.

Sherali-Adams relaxations for valued CSPs
Thapper, Johan ; Živný, Stanislav ; Laboratoire d'Informatique Gaspard-Monge (LIGM) ; et al.
42nd International Colloquium on Automata, Languages, and Programming (ICALP-2015)
https://hal.science/hal-01762339
42nd International Colloquium on Automata, Languages, and Programming (ICALP-2015), 2015, Kyoto, Japan

Optimal Torus Exploration by Oblivious Robots
Devismes, Stéphane ; Lamani, Anissa ; Petit, Franck ; et al.
NETYS 2015 - Third International Conference on Networked Systems ; https://inria.hal.science/hal-00926573 ; NETYS 2015 - Third International Conference on Networked Systems, May 2015, Agadir, Morocco. pp.183-199, ⟨10.1007/978-3-319-26850-7_13⟩

Complexity of master–slave tasking on heterogeneous trees: Complexity of master-slave tasking on heterogeneous trees
Dutot, Pierre-François ; Dutot, Pierre-François ; Parallel algorithms and load sharing (APACHE) ; et al.
European Journal of Operational Research. 164:690-695

On Markov Policies For Decentralized POMDPs ; Sur les politiques Markoviennes pour les Dec-POMDPs
Dibangoye, Jilles ; Robots coopératifs et adaptés à la présence humaine en environnements dynamiques (CHROMA) ; Centre Inria de l'Université Grenoble Alpes ; et al.
https://inria.hal.science/hal-01860060 ; [Research Report] RR-9202, INRIA Grenoble - Rhone-Alpes - CHROMA Team; CITI - CITI Centre of Innovation in Telecommunications and Integration of services; INSA Lyon. 2018.

Continuous vs. Discrete Asynchronous Moves: a Certified Approach for Mobile Robots
Balabonski, Thibaut ; Courtieu, Pierre ; Pelle, Robin ; et al.
https://hal.sorbonne-universite.fr/hal-01762962 ; [Research Report] Sorbonne Université, CNRS, Laboratoire d’Informatique de Paris 6, LIP6, F-75005 Paris, France. 2018, pp.1-12.

Churn Possibilities and Impossibilities
Foreback, Dianne ; Nesterenko, Mikhail ; Tixeuil, Sébastien ; et al.
https://hal.sorbonne-universite.fr/hal-01753397 ; [Research Report] Kent State University; Sorbonne Université, CNRS, Laboratoire d’Informatique de Paris 6, LIP6, F-75005 Paris, France. 2018.

Minimization of Automata
Berstel, Jean ; Boasson, Luc ; Carton, Olivier ; et al.
Handbook of Automata Theory ; https://hal.science/hal-01743468 ; Jean-Éric Pin. Handbook of Automata Theory, 1 (1), European Mathematical Society; EMS Press, pp.337-373, 2021, ⟨10.4171/AUTOMATA-1/10⟩

Exact Algorithm to Solve the Minimum Cost Multi-Constrained Multicast Routing Problem
Molnár, Miklós ; Methods, Algorithms for Operations REsearch (MAORE) ; Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM) ; et al.
ISSN: 2327-5219.

Approximation of Greedy Algorithms for Max-ATSP, Maximal Compression, Maximal Cycle Cover, and Shortest Cyclic Cover of Strings
Cazaux, Bastien ; Rivals, Eric ; Méthodes et Algorithmes pour la Bioinformatique (MAB) ; et al.
PSC: Prague Stringology Conference ; https://hal-lirmm.ccsd.cnrs.fr/lirmm-01100683 ; PSC: Prague Stringology Conference, Czech Technical University in Prague, Sep 2014, Prague, Czech Republic. pp.148-161 ; http://www.stringology.org/event/2014/p14.html

Affine consistency and the complexity of semilinear constraints
Jonsson, Peter ; Thapper, Johan ; Department of Computer and Information Science - Linköping University ; et al.
39th International Symposium on Mathematical Foundations of Computer Science (MFCS-2014)
https://hal.science/hal-01762331
39th International Symposium on Mathematical Foundations of Computer Science (MFCS-2014), 2014, Budapest, Hungary

Défis computationnels des séquençage et phénotypage haut débit en science de la vie
Rivals, Eric ; Méthodes et Algorithmes pour la Bioinformatique (MAB) ; Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM) ; et al.
Journées Big Data - 2ème journées - Principaux Défis ; https://hal-lirmm.ccsd.cnrs.fr/lirmm-01176768 ; Journées Big Data - 2ème journées - Principaux Défis, Laboratoire ICube, Nov 2014, Strasbourg, France ; http://icube.unistra.fr