Search
Search Results
-
Asymptotic upper bounds for an M/M/C/K retrial queue with a guard channel and guard buffer
The paper deals with Markovian multiserver retrial queuing system with exponential abandonments, two types of arrivals: Fresh calls and Handover...
-
How to Guard a Museum
In 1973 Victor Klee asked how many guards are need to observe all the walls of a museum? If the walls form a regular polygon or even a convex...
-
Mean-field optimal control in a multi-agent interaction model for prevention of maritime crime
We study a multi-agent system for the modeling maritime crime. The model involves three interacting populations of ships: commercial ships, pirate...
-
-
A new lower bound for the eternal vertex cover number of graphs
The main result in this paper is a new lower bound to the eternal vertex cover number (evc number) of an arbitrary graph G in terms of the size of...
-
Eternal Distance-k Domination on Graphs
Eternal domination is a dynamic process by which a graph is protected from an infinite sequence of vertex intrusions. In eternal distance- k ...
-
Topological Art in Simple Galleries
Let P be a simple polygon, then the art gallery problem is looking for a minimum set of points (guards) that can see every point in P . We say two...
-
Representation of the Eternal Vertex Cover Problem as a Dynamic Stackelberg Game
Eternal vertex cover problem is a variant of the graph vertex cover problem that can be considered as a dynamic game between two players (Attacker...
-
Improved Bounds on the Cop Number of a Graph Drawn on a Surface
It is known that the cop number c(G) of a connected graph G can be bounded as a function of the genus of the graph g(G). It is conjectured by...
-
Prediction of the Number of BPJS Claims due to COVID-19 Based on Community Mobility and Vaccination in DIY Province Using the Bayesian Structural Time Series
In this study, an analysis was carried out on the number of BPJS claims due to COVID-19 by considering the mobility factor of the community and the...
-
Art Gallery Problem with Rook and Queen Vision
How many chess rooks or queens does it take to guard all squares of a given polyomino, the union of square tiles from a square grid? This question is...
-
The Parameterized Complexity of Guarding Almost Convex Polygons
The Art Gallery problem is a fundamental visibility problem in Computational Geometry. The input consists of a simple polygon P , (possibly infinite)...
-
A modeling framework for adaptive collective defense: crisis response in social-insect colonies
Living systems, from cells to superorganismic insect colonies, have an organizational boundary between inside and outside and allocate resources to...
-
Internet of Things for Hybrid Energy System Data Monitoring
Internet of things (IoT) refers to the sensors and electronic devices that are able to collect and share data over the internet. In remote areas...
-
Some quantum synchronizable codes with explicit distance
Quantum synchronizable codes can be used to guard against both the interference of quantum noise on qubits and misalignment in block synchronization....
-
Exponential-time algorithms for parallel machine scheduling problems
In this paper we consider the problem of scheduling a set of jobs on unrelated parallel machines in the presence of job release dates and deadlines,...
-
Extensions of the Art Gallery Theorem
Several domination results have been obtained for maximal outerplanar graphs (mops). The classical domination problem is to minimize the size of a...
-
A Gentle Introduction to Verification of Parameterized Reactive Systems
An introduction to symbolic model-checking and deductive verification techniques is offered to Master’s students at the University of Franche-Comté....
-
How to guard a museum
Here is an appealing problem which was raised by Victor Klee in 1973. Suppose the manager of a museum wants to make sure that at all times every...
-
The Parameterized Complexity of Maximum Betweenness Centrality
Arguably, one of the most central tasks in the area of social network analysis is to identify important members and communities of a given network....