Displaying similar documents to “The Variance Location Problem on a Network with Continuously distributed demand”

Localization in wireless sensor networks: Classification and evaluation of techniques

Ewa Niewiadomska-Szynkiewicz (2012)

International Journal of Applied Mathematics and Computer Science

Similarity:

Recent advances in technology have enabled the development of low cost, low power and multi functional wireless sensing devices. These devices are networked through setting up a Wireless Sensor Network (WSN). Sensors that form a WSN are expected to be remotely deployed in large numbers and to self-organize to perform distributed sensing and acting tasks. WSNs are growing rapidly in both size and complexity, and it is becoming increasingly difficult to develop and investigate such large...

Anycasting in connection-oriented computer networks: Models, algorithms and results

Krzysztof Walkowiak (2010)

International Journal of Applied Mathematics and Computer Science

Similarity:

Our discussion in this article centers around various issues related to the use of anycasting in connection-oriented computer networks. Anycast is defined as a one-to-one-of-many transmission to deliver a packet to one of many hosts. Anycasting can be applied if the same content is replicated over many locations in the network. Examples of network techniques that apply anycasting are Content Delivery Networks (CDNs), Domain Name Service (DNS), Peer-to-Peer (P2P) systems. The role of...

On designing connected rapid transit networks reducing the number of transfers

Laureano Fernando Escudero, Susana Muñoz (2012)

RAIRO - Operations Research

Similarity:

In this paper we introduce some improvements on an approach that we described elsewhere for solving a modification of the well-known extended rapid transit network design problem. Firstly, we propose an integer programming model for selecting the stations to be constructed and the links between them, in such a way that a connected rapid transit network is obtained. Secondly, we consider a linear 0-1 programming model for determining a...

On designing connected rapid transit networks reducing the number of transfers

Laureano Fernando Escudero, Susana Muñoz (2011)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

In this paper we introduce some improvements on an approach that we described elsewhere for solving a modification of the well-known extended rapid transit network design problem. Firstly, we propose an integer programming model for selecting the stations to be constructed and the links between them, in such a way that a connected rapid transit network is obtained. Secondly, we consider a linear 0-1 programming model for determining a route of minimum length in the rapid transit network...

Local dependency in networks

Miloš Kudělka, Šárka Zehnalová, Zdeněk Horák, Pavel Krömer, Václav Snášel (2015)

International Journal of Applied Mathematics and Computer Science

Similarity:

Many real world data and processes have a network structure and can usefully be represented as graphs. Network analysis focuses on the relations among the nodes exploring the properties of each network. We introduce a method for measuring the strength of the relationship between two nodes of a network and for their ranking. This method is applicable to all kinds of networks, including directed and weighted networks. The approach extracts dependency relations among the network's nodes...