2421 search results - page 272 / 485 » Approximate Flow-Aware Networking |
123
click to vote
KDD
2004
ACM
16 years 4 months ago
2004
ACM
We define a connection subgraph as a small subgraph of a large graph that best captures the relationship between two nodes. The primary motivation for this work is to provide a pa...
144
click to vote
IPPS
2007
IEEE
15 years 10 months ago
2007
IEEE
Applications such as parallel computing, online games, and content distribution networks need to run on a set of resources with particular network connection characteristics to ge...
108
click to vote
ICANN
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. This paper presents Recurrent Policy Gradients, a modelfree reinforcement learning (RL) method creating limited-memory stochastic policies for partially observable Markov...
123
Voted
IDEAL
2004
Springer
15 years 9 months ago
2004
Springer
This paper defines a constrained Artificial Neural Network (ANN) that can be employed for highly-dependable roles in safety critical applications. The derived model is based upon t...
154
click to vote
INFOCOM
2000
IEEE
15 years 8 months ago
2000
IEEE
Abstract— Alternate path routing has been well-explored in telecommunication networks as a means of decreasing the call blocking rate and increasing network utility. However, asi...