1022 search results - page 27 / 205 » New models and algorithms for programmable networks |
EUROPAR
2007
Springer
15 years 8 months ago
2007
Springer
To fully harness Grids, users or middlewares must have some knowledge on the topology of the platform interconnection network. As such knowledge is usually not available, one must ...
152
click to vote
SPAA
1994
ACM
15 years 6 months ago
1994
ACM
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
131
Voted
ICDCIT
2007
Springer
15 years 8 months ago
2007
Springer
This paper considers the problem of unicasting in wireless ad hoc networks. Unicasting is the problem of finding a route between a source and a destination and forwarding the mess...
139
click to vote
AC
1998
Springer
15 years 1 months ago
1998
Springer
Abstract: Since von Neumann's seminal work around 1950, computer scientists and others have studied the algorithms needed to support self-replicating systems. Much of this wor...
129
Voted
CCS
2009
ACM
16 years 2 months ago
2009
ACM
Knowledge discovery on social network data can uncover latent social trends and produce valuable findings that benefit the welfare of the general public. A growing amount of resea...