13214 search results - page 372 / 2643 » Pseudorandomness for network algorithms |
176
Voted
GLOBECOM
2006
IEEE
16 years 27 days ago
2006
IEEE
— This paper develops a hierarchical iterative OSNR algorithm based on a game theory framework. A Nash game is formulated between channels with channel utility related to maximiz...
193
click to vote
ICDCS
2000
IEEE
15 years 11 months ago
2000
IEEE
Creating replicas of frequently accessed objects across a read-intensive network can result in large bandwidth savings which, in turn, can lead to reduction in user response time....
211
click to vote
P2PKM
2004
15 years 8 months ago
2004
We present RDFGrowth, an algorithm that addresses a specific yet important scenario: large scale, end user targeted, metadata exchange P2P applications. In this scenario, peers per...
185
click to vote
COMCOM
2008
15 years 7 months ago
2008
In this paper, we present Collaborative Opportunistic Recovery Algorithm (CORA) designed for multicast multimedia applications with low loss as well as latency constraints in ad h...
179
click to vote
COR
2006
15 years 6 months ago
2006
In this paper we tackle the task assignment problem (TSAP) in heterogeneous computer systems. The TSAP consists of assigning a given distributed computer program formed by a numbe...