Sciweavers

1127 search results - page 6 / 226
» New Algorithms for Generalized Network Flows
Sort
View
APN
2008
Springer
13 years 11 months ago
Faster Unfolding of General Petri Nets Based on Token Flows
In this paper we propose two new unfolding semantics for general Petri nets combining the concept of prime event structures with the idea of token flows developed in [11]. In contr...
Robin Bergenthum, Robert Lorenz, Sebastian Mauser
INFOCOM
2003
IEEE
14 years 3 months ago
A Unifying Passivity Framework for Network Flow Control
—Network flow control regulates the traffic between sources and links based on congestion, and plays a critical role in ensuring satisfactory performance. In recent studies, glob...
John T. Wen, Murat Arcak
SIGMETRICS
2009
ACM
140views Hardware» more  SIGMETRICS 2009»
14 years 4 months ago
Maximum likelihood estimation of the flow size distribution tail index from sampled packet data
In the context of network traffic analysis, we address the problem of estimating the tail index of flow (or more generally of any group) size distribution from the observation of...
Patrick Loiseau, Paulo Gonçalves, Sté...
FEGC
2008
84views Biometrics» more  FEGC 2008»
13 years 11 months ago
Structure Inference of Bayesian Networks from Data: A New Approach Based on Generalized Conditional Entropy
We propose a novel algorithm for extracting the structure of a Bayesian network from a dataset. Our approach is based on generalized conditional entropies, a parametric family of e...
Dan A. Simovici, Saaid Baraty
NETWORKS
2008
13 years 9 months ago
A simple method for improving the primal simplex method for the multicommodity flow problem
We present a new efficient approach for solving the multicommodity flow problem as a sequence of subproblems, each on a very sparse but connected network. We show that each subpro...
Agustín Bompadre, James B. Orlin