1 citations · 1 across the 5 of their papers we have counts for
3 papers · 1 filter
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…
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…