Sciweavers

453 search results - page 82 / 91
» Tight bounds for the partial-sums problem
Sort
View
ATAL
2006
Springer
13 years 11 months ago
The communication complexity of coalition formation among autonomous agents
It is self-evident that in numerous Multiagent settings, selfish agents stand to benefit from cooperating by forming coalitions. Nevertheless, negotiating a stable distribution of...
Ariel D. Procaccia, Jeffrey S. Rosenschein
ECRTS
2010
IEEE
13 years 8 months ago
Making DRAM Refresh Predictable
Embedded control systems with hard real-time constraints require that deadlines are met at all times or the system may malfunction with potentially catastrophic consequences. Sched...
Balasubramanya Bhat, Frank Mueller
TOC
2008
104views more  TOC 2008»
13 years 7 months ago
Single Source Multiroute Flows and Cuts on Uniform Capacity Networks
For an integer h 1, an elementary h-route flow is a flow along h edge disjoint paths between a source and a sink, each path carrying a unit of flow, and a single commodity h-rout...
Henning Bruhn, Jakub Cerný, Alexander Hall,...
CORR
2010
Springer
100views Education» more  CORR 2010»
13 years 6 months ago
Secret Key Generation for a Pairwise Independent Network Model
Abstract— We investigate secret key generation for a “pairwise independent network” model in which every pair of terminals observes correlated sources which are independent o...
Sirin Nitinawarat, Chunxuan Ye, Alexander Barg, Pr...
SPAA
2004
ACM
14 years 24 days ago
Online algorithms for prefetching and caching on parallel disks
Parallel disks provide a cost effective way of speeding up I/Os in applications that work with large amounts of data. The main challenge is to achieve as much parallelism as poss...
Rahul Shah, Peter J. Varman, Jeffrey Scott Vitter