459 search results - page 27 / 92 » Average Case Analysis of Conjunctive Learning Algorithms |
TNN
1998
13 years 7 months ago
1998
— In this paper, we perform a complete asymptotic performance analysis of the stochastic approximation algorithm (denoted subspace network learning algorithm) derived from Oja’...
RTSS
1998
IEEE
13 years 12 months ago
1998
IEEE
We consider the problem of implementing shared objects in uniprocessor and multiprocessor real-time systems in which tasks are executed using a scheduling quantum. In most quantum...
AUSAI
2007
Springer
14 years 1 months ago
2007
Springer
Dimensional reduction may be effective in order to compress data without loss of essential information. Also, it may be useful in order to smooth data and reduce random noise. The...
INFORMATICALT
2006
13 years 7 months ago
2006
Abstract. The asynchronous techniques that exist within the programming with distributed constraints are characterized by the occurrence of the nogood values during the search for ...
COLT
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We propose simple randomized strategies for sequential prediction under imperfect monitoring, that is, when the forecaster does not have access to the past outcomes but r...