Sciweavers

837 search results - page 49 / 168
» Distributed algorithms for reaching consensus on general fun...
Sort
View
IPPS
2007
IEEE
14 years 3 months ago
Implementing Replica Placements: Feasibility and Cost Minimization
Given two replication schemes old X and new X , the Replica Transfer Scheduling Problem (RTSP) aims at reaching new X , starting from old X , with minimal implementation cost. In ...
Thanasis Loukopoulos, Nikos Tziritas, Petros Lamps...
SIGMETRICS
2008
ACM
106views Hardware» more  SIGMETRICS 2008»
13 years 9 months ago
Fully decentralized emulation of best-effort and processor sharing queues
Control of large distributed cloud-based services is a challenging problem. The Distributed Rate Limiting (DRL) paradigm was recently proposed as a mechanism for tackling this pro...
Rade Stanojevic, Robert Shorten
GECCO
2005
Springer
146views Optimization» more  GECCO 2005»
14 years 2 months ago
An empirical study of the robustness of two module clustering fitness functions
Two of the attractions of search-based software engineering (SBSE) derive from the nature of the fitness functions used to guide the search. These have proved to be highly robust...
Mark Harman, Stephen Swift, Kiarash Mahdavi
UAI
2004
13 years 10 months ago
Bayesian Learning in Undirected Graphical Models: Approximate MCMC Algorithms
Bayesian learning in undirected graphical models--computing posterior distributions over parameters and predictive quantities-is exceptionally difficult. We conjecture that for ge...
Iain Murray, Zoubin Ghahramani
DAC
2004
ACM
14 years 10 months ago
Fast statistical timing analysis handling arbitrary delay correlations
CT An efficient statistical timing analysis algorithm that can handle arbitrary (spatial and structural) causes of delay correlation is described. The algorithm derives the entire ...
Michael Orshansky, Arnab Bandyopadhyay