A computational perspective on network coding.
Guo, Qin, Luo, Mingxing, Li, Lixiang, Yang, Yixian (2010)
Mathematical Problems in Engineering
Similarity:
Guo, Qin, Luo, Mingxing, Li, Lixiang, Yang, Yixian (2010)
Mathematical Problems in Engineering
Similarity:
Naor, Joseph, Orda, Ariel, Rom, Raphael (1998)
Journal of Graph Algorithms and Applications
Similarity:
M. Sysło (1972)
Applicationes Mathematicae
Similarity:
T. Brian Boffey, R. C. Williams, B. Pelegrín, P. Fernandez (2002)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Individual items of flow in a telecommunications or a transportation network may need to be separated by a minimum distance or time, called a “headway”. If link dependent, such restrictions in general have the effect that the minimum time path for a “convoy” of items to travel from a given origin to a given destination will depend on the size of the convoy. The Quickest Path problem seeks a path to minimise this convoy travel time. A closely related bicriterion problem is the Maximum...
Dong, Chengdong (2010)
Mathematical Problems in Engineering
Similarity:
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...
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...
Dimiter Ivanchev (1995)
The Yugoslav Journal of Operations Research
Similarity:
Dohmen, Klaus (1999)
Electronic Journal of Probability [electronic only]
Similarity:
Ioannis Gragopoulos, Fotini - Niovi Pavlidou (1994)
The Yugoslav Journal of Operations Research
Similarity:
Brian Boffey (1993)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Stanisław Bylka (2006)
Banach Center Publications
Similarity:
The problem of existence of a forecast (or planning) horizon has been considered in many special models, more or less precisely. We specify and investigate this problem for families of cheapest paths in networks with weakly ordered nodes. In a discrete network, the standard forward algorithm finds the subnetwork generated by optimal paths. The proposed forward procedure reduces subnetworks such that the forecast horizon remains unchanged. Based on the final subnetwork, we have an answer...
Domshlak, Carmel (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
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...