1 citations · 1 across the 5 of their papers we have counts for
5 papers
Finite Pinwheel Scheduling: the k-Visits Problem
Sotiris Kanellopoulos, Christos Pergaminelis, Maria Kokkou +2
Pinwheel Scheduling is a fundamental scheduling problem, in which each task is associated with a positive integer , and the objective is to schedule one task per time slot…
Exploring Graphs with Time Constraints by Unreliable Collections of Mobile Robots
Jurek Czyzowicz, Maxime Godon, Evangelos Kranakis +2
A graph environment must be explored by a collection of mobile robots. Some of the robots, a priori unknown, may turn out to be unreliable. The graph is weighted and each node is a…
Mobile Agents Rendezvous in spite of a Malicious Agent
Shantanu Das, Flaminia L. Luccio, Euripides Markou
We examine the problem of rendezvous, i.e., having multiple mobile agents gather in a single node of the network. Unlike previous studies, we need to achieve rendezvous in presence…
Black Hole Search with Finite Automata Scattered in a Synchronous Torus
Jérémie Chalopin, Shantanu Das, Arnaud Labourel +1
We consider the problem of locating a black hole in synchronous anonymous networks using finite state agents. A black hole is a harmful node in the network that destroys any agent…
Tight Bounds for Black Hole Search with Scattered Agents in Synchronous Rings
Jérémie Chalopin, Shantanu Das, Arnaud Labourel +1
We study the problem of locating a particularly dangerous node, the so-called black hole in a synchronous anonymous ring network with mobile agents. A black hole is a harmful stati…