Sciweavers

6229 search results - page 1218 / 1246
» Models of Computation for Networks on Chip
Sort
View
CCS
2009
ACM
14 years 3 months ago
Dynamic provable data possession
As storage-outsourcing services and resource-sharing networks have become popular, the problem of efficiently proving the integrity of data stored at untrusted servers has receiv...
C. Christopher Erway, Alptekin Küpç&uu...
ISLPED
2005
ACM
93views Hardware» more  ISLPED 2005»
14 years 2 months ago
Power-aware code scheduling for clusters of active disks
In this paper, we take the idea of application-level processing on disks to one level further, and focus on an architecture, called Cluster of Active Disks (CAD), where the storag...
Seung Woo Son, Guangyu Chen, Mahmut T. Kandemir
SIGECOM
2005
ACM
134views ECommerce» more  SIGECOM 2005»
14 years 2 months ago
Congestion games with failures
We introduce a new class of games, congestion games with failures (CGFs), which extends the class of congestion games to allow for facility failures. In a basic CGF (BCGF) agents ...
Michal Penn, Maria Polukarov, Moshe Tennenholtz
COCOON
2005
Springer
14 years 2 months ago
Server Allocation Algorithms for Tiered Systems
Many web-based systems have a tiered application architecture, in which a request needs to transverse all the tiers before finishing its processing. One of the most important QoS...
Kamalika Chaudhuri, Anshul Kothari, Rudi Pendaving...
ASIAN
2004
Springer
180views Algorithms» more  ASIAN 2004»
14 years 2 months ago
Counting by Coin Tossings
Abstract. This text is an informal review of several randomized algorithms that have appeared over the past two decades and have proved instrumental in extracting efficiently quant...
Philippe Flajolet
« Prev « First page 1218 / 1246 Last » Next »