2421 search results - page 181 / 485 » Approximate Flow-Aware Networking |
109
Voted
DATE
2002
IEEE
15 years 8 months ago
2002
IEEE
We present a new passive model reduction algorithm based on the Laguerre expansion of the time response of interconnect networks. We derive expressions for the Laguerre coefficie...
119
Voted
FOCS
1996
IEEE
15 years 7 months ago
1996
IEEE
In the minimum path coloring problem, we are given a list of pairs of vertices of a graph. We are asked to connect each pair by a colored path. Paths of the same color must be edg...
181
click to vote
EWRL
2008
15 years 5 months ago
2008
A wide variety of function approximation schemes have been applied to reinforcement learning. However, Bayesian filtering approaches, which have been shown efficient in other field...
114
Voted
ICML
2010
IEEE
15 years 4 months ago
2010
IEEE
We introduce a natural generalization of submodular set cover and exact active learning with a finite hypothesis class (query learning). We call this new problem interactive submo...
103
Voted
TPDS
2008
15 years 3 months ago
2008
We consider the Continuous Delivery Message Dissemination (CDMD) problem over the n-processor single-port complete (all links are present and are bidirectional) static network with...