Sciweavers

909 search results - page 132 / 182
» The Economics of Large-Memory Computations
Sort
View
SIGECOM
2006
ACM
143views ECommerce» more  SIGECOM 2006»
15 years 6 months ago
Braess's paradox in large random graphs
Braess’s Paradox is the counterintuitive but well-known fact that removing edges from a network with “selfish routing” can decrease the latency incurred by traffic in an eq...
Gregory Valiant, Tim Roughgarden
CODES
2005
IEEE
15 years 6 months ago
Future processors: flexible and modular
The ability to continue increasing processor frequency and single thread performance is being severely limited by exponential increases in leakage and active power. To continue to...
Charlie Johnson, Jeff Welser
HOTI
2005
IEEE
15 years 6 months ago
Design of Randomized Multichannel Packet Storage for High Performance Routers
High performance routers require substantial amounts of memory to store packets awaiting transmission, requiring the use of dedicated memory devices with the density and capacity ...
Sailesh Kumar, Patrick Crowley, Jonathan S. Turner
LAWEB
2005
IEEE
15 years 6 months ago
Incentive Networks
The concurrent growth of on-line communities exhibiting large-scale social structure, and of large decentralized peer-to-peer file-sharing systems, has stimulated new interest in...
Prabhakar Raghavan
117
Voted
JCDL
2005
ACM
153views Education» more  JCDL 2005»
15 years 6 months ago
Developing the DigiQUAL protocol for digital library evaluation
The distributed, project-oriented nature of digital libraries (DLs) has made them difficult to evaluate in aggregate. By modifying the methods and tools used to evaluate tradition...
Martha Kyrillidou, Sarah Giersch