2814 search results - page 82 / 563 » Competitive Analysis of Distributed Algorithms |
114
click to vote
CORR
2010
Springer
15 years 21 days ago
2010
Springer
—We apply large deviations theory to study asymptotic performance of running consensus distributed detection in sensor networks. Running consensus is a stochastic approximation t...
144
click to vote
CEC
2005
IEEE
15 years 4 months ago
2005
IEEE
Abstract- Theoretical analysis of the dynamics of evolutionary algorithms is believed to be very important to understand the search behavior of evolutionary algorithms and to devel...
128
click to vote
SAC
2006
ACM
15 years 8 months ago
2006
ACM
This paper explores the generation of candidates, which is an important step in frequent itemset mining algorithms, from a theoretical point of view. Important notions in our prob...
102
click to vote
CP
2000
Springer
15 years 6 months ago
2000
Springer
Random Noise and Random Walk algorithms are local search strategies that have been used for the problem of satisfiability testing (SAT). We present a Markov-chain based analysis o...
122
click to vote
IJCAI
1993
15 years 3 months ago
1993
In this paper we present an average-case analysis of the nearest neighbor algorithm, a simple induction method that has been studied by manyresearchers. Our analysis assumes a con...