Sciweavers

1127 search results - page 30 / 226
» New Algorithms for Generalized Network Flows
Sort
View
AAAI
2008
15 years 10 days ago
Memetic Networks: Analyzing the Effects of Network Properties in Multi-Agent Performance
We explore the relationship between properties of the network defined by connected agents and the global system performance. This is achieved by means of a novel class of optimiza...
Ricardo M. Araujo, Luís C. Lamb
ESA
2004
Springer
126views Algorithms» more  ESA 2004»
15 years 3 months ago
Path Decomposition Under a New Cost Measure with Applications to Optical Network Design
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
Elliot Anshelevich, Lisa Zhang
COMCOM
2010
179views more  COMCOM 2010»
14 years 10 months ago
On the statistical characterization of flows in Internet traffic with application to sampling
A new method of estimating some statistical characteristics of TCP flows in the Internet is developed in this paper. For this purpose, a new set of random variables (referred to as...
Yousra Chabchoub, Christine Fricker, Fabrice Guill...
NOSSDAV
2009
Springer
15 years 4 months ago
Rapid identification of Skype traffic flows
In this paper we present results of experimental work using machine learning techniques to rapidly identify Skype traffic. We show that Skype traffic can be identified by observin...
Philip Branch, Amiel Heyde, Grenville J. Armitage
EOR
2008
106views more  EOR 2008»
14 years 10 months ago
Convergent Lagrangian heuristics for nonlinear minimum cost network flows
We consider the separable nonlinear and strictly convex single-commodity network flow problem (SSCNFP). We develop a computational scheme for generating a primal feasible solution...
Torbjörn Larsson, Johan Marklund, Caroline Ol...