152 search results - page 12 / 31 » How Expensive Is Link Utilization |
KIVS
1999
Springer
13 years 12 months ago
1999
Springer
Abstract Charging schemes are needed to protect an integrated services network from arbitrary resource reservations and to create a funding mechanism to extend network capacity at ...
JMLR
2008
13 years 7 months ago
2008
We show how a generic feature selection algorithm returning strongly relevant variables can be turned into a causal structure learning algorithm. We prove this under the Faithfuln...
EDBT
2012
ACM
11 years 10 months ago
2012
ACM
In this paper, we study how to find maximal k-edge-connected subgraphs from a large graph. k-edge-connected subgraphs can be used to capture closely related vertices, and findin...
INFOCOM
2007
IEEE
14 years 2 months ago
2007
IEEE
— Scalable and efficient routing is a main challenge in the deployment of large ad hoc wireless networks. An essential element of practical routing protocols is their accommodat...
ANCS
2007
ACM
13 years 11 months ago
2007
ACM
Programming specialized network processors (NPU) is inherently difficult. Unlike mainstream processors where architectural features such as out-of-order execution and caches hide ...