Sciweavers

4781 search results - page 71 / 957
» Online algorithms for network design
Sort
View
AUSAI
2005
Springer
15 years 7 months ago
Global Versus Local Constructive Function Approximation for On-Line Reinforcement Learning
: In order to scale to problems with large or continuous state-spaces, reinforcement learning algorithms need to be combined with function approximation techniques. The majority of...
Peter Vamplew, Robert Ollington
NIPS
2003
15 years 2 months ago
Online Learning of Non-stationary Sequences
We consider an online learning scenario in which the learner can make predictions on the basis of a fixed set of experts. We derive upper and lower relative loss bounds for a cla...
Claire Monteleoni, Tommi Jaakkola
IPPS
1997
IEEE
15 years 5 months ago
Designing Efficient Distributed Algorithms Using Sampling Techniques
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...
Sanguthevar Rajasekaran, David S. L. Wei
KDD
2009
ACM
146views Data Mining» more  KDD 2009»
15 years 8 months ago
Online allocation of display advertisements subject to advanced sales contracts
In this paper we propose a utility model that accounts for both sales and branding advertisers. We first study the computational complexity of optimization problems related to bo...
Saeed Alaei, Esteban Arcaute, Samir Khuller, Wenji...
ICONIP
2008
15 years 2 months ago
On Node-Fault-Injection Training of an RBF Network
Abstract. While injecting fault during training has long been demonstrated as an effective method to improve fault tolerance of a neural network, not much theoretical work has been...
John Sum, Chi-Sing Leung, Kevin Ho