2434 search results - page 131 / 487 » Algorithmic Randomness of Closed Sets |
133
Voted
COLT
1998
Springer
15 years 7 months ago
1998
Springer
Abstract. We describe several improvements to Freund and Schapire's AdaBoost boosting algorithm, particularly in a setting in which hypotheses may assign confidences to each o...
111
Voted
CP
2008
Springer
15 years 5 months ago
2008
Springer
Experimentation of new algorithms is the usual companion section of papers dealing with SAT. However, the behavior of those algorithms is so unpredictable that even strong experime...
102
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Since the inception of genetic algorithmics the identification of computational efficiencies of the simple genetic algorithm (SGA) has been an important goal. In this paper we dist...
146
Voted
JMLR
2006
15 years 3 months ago
2006
This paper is about non-approximate acceleration of high-dimensional nonparametric operations such as k nearest neighbor classifiers. We attempt to exploit the fact that even if w...
165
Voted
ICDCS
1997
IEEE
15 years 7 months ago
1997
IEEE
Two novel suboptimal algorithms for mutual exclusion in distributed systems are presented. One is based on the modi cation of Maekawa's grid based quorum scheme. The size of ...