1778 search results - page 26 / 356 » On the Power of the Randomized Iterate |
SIAMCO
2000
14 years 9 months ago
2000
We study almost-sure limiting properties, taken as 0, of the finite horizon sequence of random estimates { 0, 1, 2, . . . , T/ } for the linear stochastic gradient algorithm n+1 ...
AI
2003
Springer
15 years 2 months ago
2003
Springer
MAX-SAT, the optimisation variant of the satisfiability problem in propositional logic, is an important and widely studied combinatorial optimisation problem with applications in ...
ISCAS
2008
IEEE
15 years 4 months ago
2008
IEEE
— In this paper we propose a method for lowering the power consumption in our previously proposed method for approximating elementary functions. By rearranging the interconnect o...
74
Voted
IJPP
2011
14 years 4 months ago
2011
With the advent of multi-core processors, desktop application developers must finally face parallel computing and its challenges. A large portion of the computational load in a p...
COLT
2007
Springer
15 years 3 months ago
2007
Springer
This paper solves an important problem left open in the literature by showing that U-shapes are unnecessary in iterative learning. A U-shape occurs when a learner first learns, t...