114 search results - page 22 / 23 » Optimal Routing in Binomial Graph Networks |
98
Voted
CLUSTER
2002
IEEE
14 years 9 months ago
2002
IEEE
In this paper, we propose an on-demand distributed clustering algorithm for multi-hop packet radio networks. These types of networks, also known as ad hoc networks, are dynamic in ...
FOCS
2004
IEEE
15 years 1 months ago
2004
IEEE
We prove the existence of tolls to induce multicommodity, heterogeneous network users that independently choose routes minimizing their own linear function of tolls versus latency...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
65
Voted
APPML
2007
14 years 9 months ago
2007
The problem of optimal transportation between a set of sources and a set of wells has become recently the object of new mathematical models generalizing the Monge-Kantorovich prob...
96
Voted
ICML
1996
IEEE
15 years 10 months ago
1996
IEEE
Some of the most successful recent applications of reinforcement learning have used neural networks and the TD algorithm to learn evaluation functions. In this paper, we examine t...