Sciweavers

290 search results - page 5 / 58
» Balancing Applied to Maximum Network Flow Problems
Sort
View
DIALM
2008
ACM
139views Algorithms» more  DIALM 2008»
13 years 9 months ago
Approximating maximum integral flows in wireless sensor networks via weighted-degree constrained k-flows
We consider the Maximum Integral Flow with Energy Constraints problem: given a directed graph G = (V, E) with edge-weights {w(e) : e E} and node battery capacities {b(v) : v V }...
Zeev Nutov
NETWORKS
2008
13 years 7 months ago
Reformulation and sampling to solve a stochastic network interdiction problem
The Network Interdiction Problem involves interrupting an adversary's ability to maximize flow through a capacitated network by destroying portions of the network. A budget c...
Udom Janjarassuk, Jeff Linderoth
ECAL
2007
Springer
13 years 11 months ago
Energy Flows and Maximum Power on an Evolutionary Ecological Network Model
Energy flows in ecological systems which are determined by the structure of the ecological network influence the evolution of the network itself. The total system energy throughflo...
Jiang Zhang
SIGMETRICS
2009
ACM
140views Hardware» more  SIGMETRICS 2009»
14 years 1 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é...
MASCOTS
2008
13 years 8 months ago
Tackling the Memory Balancing Problem for Large-Scale Network Simulation
A key obstacle to large-scale network simulation over PC clusters is the memory balancing problem where a memory-overloaded machine can slow down an entire simulation due to disk ...
Hyojeong Kim, Kihong Park