111 citations
- Centre National de la Recherche ScientifiqueFR8 papers
- Département d'InformatiqueFR5 papers
- Université de Picardie Jules VerneFR5 papers
- Carleton UniversityCA4 papers
- Concordia UniversityCA4 papers
- Laboratoire d’Informatique Fondamentale de MarseilleFR4 papers
- Modélisation, information et systèmesFR4 papers
- Polytechnique MontréalCA4 papers
- University of OttawaCA4 papers
- Wesleyan UniversityUS4 papers
- Aix-Marseille UniversitéFR3 papers
- HEC MontréalCA3 papers
4 papers · 1 filter
Decidability Classes for Mobile Agents Computing
Pierre Fraigniaud, Andrzej Pelc
We establish a classification of decision problems that are to be solved by mobile agents operating in unlabeled graphs, using a deterministic protocol. The classification is with…
Time Series, Stochastic Processes and Completeness of Quantum Theory
Marian Kupczynski
Most of physical experiments are usually described as repeated measurements of some random variables. The experimental data registered by on-line computers form time series of outc…
Asynchronous deterministic rendezvous in bounded terrains
Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel +1
Two mobile agents (robots) have to meet in an a priori unknown bounded terrain modeled as a polygon, possibly with polygonal obstacles. Agents are modeled as points, and each of th…
Optimal Exploration of Terrains with Obstacles
Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel +1
A mobile robot represented by a point moving in the plane has to explore an unknown terrain with obstacles. Both the terrain and the obstacles are modeled as arbitrary polygons. We…