Filtrer vos résultats
- 34
- 15
- 29
- 14
- 3
- 2
- 1
- 49
- 3
- 5
- 9
- 2
- 4
- 4
- 3
- 1
- 6
- 1
- 5
- 4
- 1
- 1
- 49
- 26
- 19
- 9
- 7
- 6
- 4
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 49
- 27
- 8
- 7
- 5
- 5
- 5
- 5
- 5
- 5
- 4
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
49 résultats
|
|
triés par
|
|
Collaborative delivery on a fixed path with homogeneous energy-constrained agentsTheoretical Computer Science, 2021, 868, pp.87-96. ⟨10.1016/j.tcs.2021.04.004⟩
Article dans une revue
hal-03287588v1
|
||
Gathering of Mobile Robots Tolerating Multiple Crash FaultsInternational Conference on Distributed Computing Systems, Jul 2013, Philadelphia, United States. pp.337-346, ⟨10.1109/ICDCS.2013.27⟩
Communication dans un congrès
hal-00930074v1
|
|||
Groupings and Pairings in Anonymous NetworksDISC 2006, Sep 2006, Sweden. pp.105-119
Communication dans un congrès
hal-00308128v1
|
|||
Mediated Population Protocols: Leader Election and ApplicationsTheory and Applications of Models of Computation - 14th Annual Conference, {TAMC} 2017, Apr 2017, Bern, Switzerland. pp.172-186, ⟨10.1007/978-3-319-55911-7_13⟩
Communication dans un congrès
hal-03608618v1
|
|||
|
Lock-in Problem for Parallel Rotor-router Walks2015
Pré-publication, Document de travail
hal-01021930v3
|
||
|
Deterministic Symmetric Rendezvous in Arbitrary Graphs: Overcoming Anonymity, Failures and UncertaintyAlpern, Steve and Fokkink, Robbert and Gasieniec, Leszek and Lindelauf, Roy and Subrahmanian, V. S. Search theory: A game theoretic perspective, Springer, pp.175--195, 2013, 978-1-4614-6824-0. ⟨10.1007/978-1-4614-6825-7_12⟩
Chapitre d'ouvrage
hal-01199884v1
|
||
Brief Announcement: Wait-Free Gathering of Mobile RobotsInternational Symposium on Distributed Computing, Oct 2012, Salvador, Brazil. pp.401-402, ⟨10.1007/978-3-642-33651-5_28⟩
Communication dans un congrès
hal-00934220v1
|
|||
Rendez vous of mobile agents in unknown graphs with faulty linksDISC 2007, Sep 2007, Cyprus. pp.108--122
Communication dans un congrès
hal-00308123v1
|
|||
|
Collaborative Delivery with Energy-Constrained Mobile Robots 23rd International Colloquium on Structural Information and Communication Complexity, Jun 2016, Helsinki, Finland. pp.258 - 274, ⟨10.1007/978-3-319-48314-6_17⟩
Communication dans un congrès
hal-01480368v1
|
||
Gathering of Robots in a Grid with Mobile FaultsSOFSEM 2019: Theory and Practice of Computer Science., Jan 2019, Nový Smokovec, Slovakia. pp.164-178, ⟨10.1007/978-3-030-10801-4_14⟩
Communication dans un congrès
hal-02082188v1
|
|||
Distributed Evacuation in Graphs with Multiple ExitsStructural Information and Communication Complexity - 23rd International Colloquium, {SIROCCO} 2016, Jul 2016, Helsinki, Finland. pp.228-241, ⟨10.1007/978-3-319-48314-6_15⟩
Communication dans un congrès
hal-03608616v1
|
|||
Collaborative Exploration of Trees by Energy-Constrained Mobile RobotsTheory of Computing Systems, 2018, 62 (5), pp.1223-1240. ⟨10.1007/s00224-017-9816-3⟩
Article dans une revue
hal-02082153v1
|
|||
Energy-Efficient Delivery by Heterogeneous Mobile AgentsSTACS 2017, 2017, Hannover, Germany. ⟨10.4230/LIPIcs.STACS.2017.10⟩
Communication dans un congrès
hal-01787218v1
|
|||
|
Tight bounds for black hole search with scattered agents in synchronous ringsTheoretical Computer Science, 2013, Structural Information and Communication Complexity, 509, pp.70-85. ⟨10.1016/j.tcs.2013.02.010⟩
Article dans une revue
hal-01195901v1
|
||
Brief Announcement: Energy Constrained Depth First SearchICALP 2018: 45th International Colloquium on Automata, Languages, and Programming, Jul 2018, Prague, Czech Republic
Communication dans un congrès
hal-02082201v1
|
|||
Near-Gathering of Energy-Constrained Mobile Agents26th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2019), Jul 2019, L'Aquila, Italy. pp.52-65, ⟨10.1007/978-3-030-24922-9/_4⟩
Communication dans un congrès
hal-02351154v1
|
|||
Broadcasting with Mobile Agents in Dynamic Networks24th International Conference on Principles of Distributed Systems (OPODIS 2020), Dec 2020, Strasbourg, France. pp.24:1--24:16
Communication dans un congrès
hal-03594879v1
|
|||
Collaborative Delivery by Energy-Sharing Low-Power Mobile RobotsAlgorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, {ALGOSENSORS} 2017, Sep 2017, Vienna, Austria. pp.1-12, ⟨10.1007/978-3-319-72751-6_1⟩
Communication dans un congrès
hal-03614112v1
|
|||
|
How Simple Robots Benefit from Looking BackAlgorithms and Complexity, 7th International Conference, CIAC 2010, 2010, Rome, Italy. pp.229--239, ⟨10.1007/978-3-642-13073-1_21⟩
Communication dans un congrès
hal-01198881v1
|
||
|
Patrolling on Dynamic Ring Networks45th SOFSEM 2019, Jan 2019, Nový Smokovec, Slovakia. pp.150-163, ⟨10.1007/978-3-030-10801-4_13⟩
Communication dans un congrès
hal-02068231v1
|
||
|
Forming Sequences of Patterns With Luminous RobotsIEEE Access, 2020, 8, pp.90577-90597. ⟨10.1109/ACCESS.2020.2994052⟩
Article dans une revue
hal-03594867v1
|
||
Constructing a Map of an Anonymous Graph: Applications of Universal SequencesOPODIS - 14th International Conference On Principles Of DIstributed Systems - 2010, 2010, Tozeur, Tunisia. pp.119-134, ⟨10.1007/978-3-642-17653-1_10⟩
Communication dans un congrès
istex
hal-00726071v1
|
|||
|
Autonomous mobile robots with lightsTheoretical Computer Science, 2016, 609, pp.171-184. ⟨10.1016/j.tcs.2015.09.018⟩
Article dans une revue
hal-02082178v1
|
||
Rendezvous of Mobile Agents without Agreement on Local OrientationAutomata, Languages and Programming, 37th International Colloquium, ICALP 2010, 2010, Bordeaux, France. pp.515--526, ⟨10.1007/978-3-642-14162-1_43⟩
Communication dans un congrès
istex
hal-01198883v1
|
|||
|
Mapping Simple Polygons: How Robots Benefit from Looking BackAlgorithmica, 2013, 65 (1), pp.43--59. ⟨10.1007/s00453-011-9572-8⟩
Article dans une revue
hal-01198892v1
|
||
|
Tight Bounds for Scattered Black Hole Search in a Ring18th International Colloquium on Structural Information and Communication Complexity (SIROCCO), Jun 2011, Gdańsk, Poland. pp.186-197, ⟨10.1007/978-3-642-22212-2_17⟩
Communication dans un congrès
hal-00866368v1
|
||
|
Tight Bounds for Black Hole Search with Scattered Agents in Synchronous Rings2011
Rapport
hal-00588856v1
|
||
|
Oblivious Permutations on the Plane23rd International Conference on Principles of Distributed Systems (OPODIS 2019), Dec 2019, Neuchâtel, Switzerland. ⟨10.4230/LIPIcs.OPODIS.2019.24⟩
Communication dans un congrès
hal-03594889v1
|
||
Moving and Computing Models: AgentsDistributed Computing By Mobile Entities, pp.15-34, 2019, ⟨10.1007/978-3-030-11072-7_2⟩
Chapitre d'ouvrage
hal-02082130v1
|
|||
|
Black Hole Search with Finite Automata Scattered in a Synchronous Torus2011
Rapport
hal-00604523v2
|
- 1
- 2