2421 search results - page 104 / 485 » Approximate Flow-Aware Networking |
SODA
1998
ACM
14 years 11 months ago
1998
ACM
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
ICDE
2009
IEEE
15 years 4 months ago
2009
IEEE
— Large graphs and networks are abundant in modern information systems: entity-relationship graphs over relational data or Web-extracted entities, biological networks, social onl...
COCOON
2008
Springer
14 years 12 months ago
2008
Springer
In this paper, we introduce the generalized capacitated tree-routing problem (GCTR), which is described as follows. Given a connected graph G = (V, E) with a sink s V and a set M...
IWANN
1999
Springer
15 years 2 months ago
1999
Springer
To avoid the curse of dimensionality, function approximators are used in reinforcement learning to learn value functions for individual states. In order to make better use of comp...
IWANN
2001
Springer
15 years 2 months ago
2001
Springer
We propose a novel approach based upon a superposition of ‘colored’ and ‘white’ noise to approximate current inputs in neural models. Numerical results show that the novel ...