Sciweavers

646 search results - page 100 / 130
» Generalized efficiency bounds in distributed resource alloca...
Sort
View
ATAL
2009
Springer
15 years 8 months ago
Analyzing the tradeoffs between breakup and cloning in the context of organizational self-design
Organizational Self-Design (OSD) has been proposed as an approach to constructing suitable organizations at runtime in which the agents are responsible for constructing their own ...
Sachin Kamboj
IMC
2010
ACM
14 years 11 months ago
Measuring the mixing time of social graphs
Social networks provide interesting algorithmic properties that can be used to bootstrap the security of distributed systems. For example, it is widely believed that social networ...
Abedelaziz Mohaisen, Aaram Yun, Yongdae Kim
159
Voted
SIGMETRICS
2012
ACM
248views Hardware» more  SIGMETRICS 2012»
13 years 4 months ago
Pricing cloud bandwidth reservations under demand uncertainty
In a public cloud, bandwidth is traditionally priced in a pay-asyou-go model. Reflecting the recent trend of augmenting cloud computing with bandwidth guarantees, we consider a n...
Di Niu, Chen Feng, Baochun Li
CEC
2010
IEEE
15 years 3 months ago
Generating a novel sort algorithm using Reinforcement Programming
Abstract-- Reinforcement Programming (RP) is a new approach to automatically generating algorithms, that uses reinforcement learning techniques. This paper describes the RP approac...
Spencer K. White, Tony R. Martinez, George L. Rudo...
SODA
2003
ACM
102views Algorithms» more  SODA 2003»
15 years 3 months ago
Online paging with arbitrary associativity
We tackle the problem of online paging on two level memories with arbitrary associativity (including victim caches, skewed caches etc.). We show that some important classes of pag...
Enoch Peserico