1612 search results - page 36 / 323 » Analysing Randomized Distributed Algorithms |
IJKESDP
2010
13 years 8 months ago
2010
Cognitive Agents must be able to decide their actions based on their recognized states. In general, learning mechanisms are equipped for such agents in order to realize intellgent ...
INCDM
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. Clustering algorithms for multidimensional numerical data must overcome special difficulties due to the irregularities of data distribution. We present a clustering algo...
STOC
2003
ACM
14 years 11 months ago
2003
ACM
In this paper, we present the first average-case analysis proving an expected polynomial running time for an exact algorithm for the 0/1 knapsack problem. In particular, we prove,...
MCS
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. We report on our recent progress in developing an ensemble of classifiers based algorithm for addressing the missing feature problem. Inspired in part by the random subsp...
IPPS
1997
IEEE
14 years 2 months ago
1997
IEEE
In this paper we show the power of sampling techniques in designing efficient distributed algorithms. In particular, we show that using sampling techniques, on some networks, sele...