Sciweavers

2925 search results - page 199 / 585
» Information Complexity of Online Problems
Sort
View
WWW
2008
ACM
16 years 7 months ago
Using the wisdom of the crowds for keyword generation
In the sponsored search model, search engines are paid by businesses that are interested in displaying ads for their site alongside the search results. Businesses bid for keywords...
Ariel Fuxman, Panayiotis Tsaparas, Kannan Achan, R...
ICML
2009
IEEE
16 years 7 months ago
Approximate inference for planning in stochastic relational worlds
Relational world models that can be learned from experience in stochastic domains have received significant attention recently. However, efficient planning using these models rema...
Tobias Lang, Marc Toussaint
ICML
2008
IEEE
16 years 7 months ago
Empirical Bernstein stopping
Sampling is a popular way of scaling up machine learning algorithms to large datasets. The question often is how many samples are needed. Adaptive stopping algorithms monitor the ...
Csaba Szepesvári, Jean-Yves Audibert, Volod...
ISAAC
2001
Springer
104views Algorithms» more  ISAAC 2001»
15 years 11 months ago
Algorithms for Pattern Involvement in Permutations
We consider the problem of developing algorithms for the recognition of a fixed pattern within a permutation. These methods are based upon using a carefully chosen chain or tree ...
Michael H. Albert, Robert E. L. Aldred, Mike D. At...
ICANN
2010
Springer
15 years 7 months ago
Reinforcement Learning Based Neural Controllers for Dynamic Processes without Exploration
Abstract. In this paper we present a Reinforcement Learning (RL) approach with the capability to train neural adaptive controllers for complex control problems without expensive on...
Frank-Florian Steege, André Hartmann, Erik ...