2814 search results - page 151 / 563 » Competitive Analysis of Distributed Algorithms |
153
click to vote
ACML
2009
Springer
15 years 7 months ago
2009
Springer
A fundamental assumption for any machine learning task is to have training and test data instances drawn from the same distribution while having a sufficiently large number of tra...
109
Voted
ECIR
2009
Springer
15 years 11 months ago
2009
Springer
The aim of query-based sampling is to obtain a sufficient, representative sample of an underlying (text) collection. Current measures for assessing sample quality are too coarse gr...
121
click to vote
ISPAN
1999
IEEE
15 years 7 months ago
1999
IEEE
In this work, we develop a novel mathematical model to analyze di erent location update protocols for mobile cellular network. Our model can capture many important features of use...
135
Voted
PRDC
2007
IEEE
15 years 9 months ago
2007
IEEE
Consensus is one of the most fundamental problems in fault-tolerant distributed computing. This paper proposes a mechanical method for analyzing the condition that allows one to s...
96
Voted
EVOW
2010
Springer
15 years 9 months ago
2010
Springer
We describe and evaluate a multi-objective optimisation (MOO) algorithm that works within the Probability Collectives (PC) optimisation framework. PC is an alternative approach to ...