149 search results - page 22 / 30 » On Finding Minimum Deadly Sets for Directed Networks |
JAL
2006
13 years 7 months ago
2006
In this paper we consider the unsplittable flow problem (UFP): given a directed or undirected network G = (V, E) with edge capacities and a set of terminal pairs (or requests) wit...
APIN
2006
13 years 7 months ago
2006
It is not an easy task to know a priori the most appropriate fuzzy sets that cover the domains of quantitative attributes for fuzzy association rules mining. In general, it is unre...
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
—Although network-wide flooding in reactive routing protocols like AODV [1] facilitates the discovery of optimal routes, they engender large control overhead. Some efficient floo...
CN
2010
13 years 7 months ago
2010
Most existing criteria [3], [5], [8] for sizing router buffers rely on explicit formulation of the relationship between buffer size and characteristics of Internet traffic. However...
TKDE
2008
13 years 7 months ago
2008
Given a transportation network having source nodes with evacuees and destination nodes, we want to find a contraflow network configuration (that is, ideal direction for each edge) ...