Sciweavers

2814 search results - page 63 / 563
» Competitive Analysis of Distributed Algorithms
Sort
View
INFOCOM
2005
IEEE
14 years 3 months ago
Gossip algorithms: design, analysis and applications
Abstract— Motivated by applications to sensor, peer-topeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and...
Stephen P. Boyd, Arpita Ghosh, Balaji Prabhakar, D...
CORR
2010
Springer
83views Education» more  CORR 2010»
13 years 7 months ago
List Factoring and Relative Worst Order Analysis
Relative worst order analysis is a supplement or alternative to competitive analysis which has been shown to give results more in accordance with observed behavior of online algori...
Martin R. Ehmsen, Jens S. Kohrt, Kim S. Larsen
FSKD
2008
Springer
120views Fuzzy Logic» more  FSKD 2008»
13 years 11 months ago
An Unsupervised Gaussian Mixture Classification Mechanism Based on Statistical Learning Analysis
This paper presents a scheme for unsupervised classification with Gaussian mixture models by means of statistical learning analysis. A Bayesian Ying-Yang harmony learning system a...
Rui Nian, Guangrong Ji, Michel Verleysen
ESA
2007
Springer
105views Algorithms» more  ESA 2007»
14 years 4 months ago
Non-clairvoyant Batch Sets Scheduling: Fairness Is Fair Enough
In real systems, such as operating systems, the scheduler is often unaware of the remaining work in each job or of the ability of the job to take advantage of more resources. In th...
Julien Robert, Nicolas Schabanel
CCGRID
2010
IEEE
13 years 11 months ago
The Failure Trace Archive: Enabling Comparative Analysis of Failures in Diverse Distributed Systems
With the increasing functionality and complexity of distributed systems, resource failures are inevitable. While numerous models and algorithms for dealing with failures exist, th...
Derrick Kondo, Bahman Javadi, Alexandru Iosup, Dic...