2421 search results - page 97 / 485 » Approximate Flow-Aware Networking |
152
click to vote
MOBIHOC
2002
ACM
16 years 2 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
114
click to vote
WEA
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We implement the approximation algorithm for the multicast congestion problem in communication networks in [14] based on the fast approximation algorithm for packing prob...
106
click to vote
PE
2006
Springer
15 years 2 months ago
2006
Springer
We consider multi-class blocking systems in which jobs require a single processing step. There are groups of servers that can each serve a different subset of all job classes. The...
137
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Temporal difference methods are theoretically grounded and empirically effective methods for addressing reinforcement learning problems. In most real-world reinforcement learning ...
109
click to vote
STOC
2005
ACM
16 years 3 months ago
2005
ACM
We consider the problem of approximately counting integral flows in a network. We show that there is an fpras based on volume estimation if all capacities are sufficiently large, ...