Πλοήγηση ανά Θέμα "Deterministic algorithms"
Αποτελέσματα 1-5 από 5
-
Black hole search and exploration in unoriented tori with synchronous scattered finite automata
(2012)We consider the problem of locating a black hole in a synchronous, anonymous, and unoriented torus network using mobile agents. A black hole is a harmful network node that destroys any agent visiting it without leaving any ... -
Energy-aware base stations: The effect of planning, management, and femto Layers
(2014)We compare the performance of three base station management schemes on three different network topologies. In addition, we explore the effect of offloading traffic to heterogeneous femtocell layer upon energy savings taking ... -
Gathering of robots in a grid with mobile faults
(2019)The gathering of two or more agents in a graph is an important problem in the area of distributed computing and has been extensively studied especially for the fault free scenario. In this paper we consider the mobile ... -
Online graph exploration with advice
(2012)We study the problem of exploring an unknown undirected graph with non-negative edge weights. Starting at a distinguished initial vertex s, an agent must visit every vertex of the graph and return to s. Upon visiting a ... -
Online live VM migration algorithms to minimize total migration time and downtime
(2019)Virtual machine (VM) migration is a widely used technique in cloud computing systems to increase reliability. There are also many other reasons that a VM is migrated during its lifetime, such as reducing energy consumption, ...