Sciweavers

186 search results - page 12 / 38
» The Partial Augment-Relabel Algorithm for the Maximum Flow P...
Sort
View
NETWORKS
2008
13 years 8 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
WWW
2007
ACM
14 years 9 months ago
Identifying and discriminating between web and peer-to-peer traffic in the network core
Traffic classification is the ability to identify and categorize network traffic by application type. In this paper, we consider the problem of traffic classification in the netwo...
Jeffrey Erman, Anirban Mahanti, Martin F. Arlitt, ...
EH
2002
IEEE
139views Hardware» more  EH 2002»
14 years 1 months ago
Evolving Cellular Automata to Model Fluid Flow in Porous Media
Fluid flow in porous media is a dynamic process that is traditionally modeled using PDE (Partial Differential Equations). In this approach, physical properties related to fluid fl...
Tina Yu, Seong Lee
TCOM
2008
120views more  TCOM 2008»
13 years 8 months ago
Network Coding for Efficient Multicast Routing in Wireless Ad-hoc Networks
Network coding is a powerful coding technique that has been proved to be very effective in achieving the maximum multicast capacity. It is especially suited for new emerging networ...
Jingyao Zhang, Pingyi Fan, Khaled Ben Letaief
PODC
2009
ACM
14 years 9 months ago
Distributed and parallel algorithms for weighted vertex cover and other covering problems
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...
Christos Koufogiannakis, Neal E. Young