Sciweavers

1578 search results - page 183 / 316
» Algorithmic randomness of continuous functions
Sort
View
COLT
2007
Springer
14 years 3 months ago
Improved Rates for the Stochastic Continuum-Armed Bandit Problem
Abstract. Considering one-dimensional continuum-armed bandit problems, we propose an improvement of an algorithm of Kleinberg and a new set of conditions which give rise to improve...
Peter Auer, Ronald Ortner, Csaba Szepesvári
ACMICEC
2007
ACM
107views ECommerce» more  ACMICEC 2007»
14 years 28 days ago
A family of growth models for representing the price process in online auctions
Bids during an online auction arrive at unequally-spaced discrete time points. Our goal is to capture the entire continuous price-evolution function by representing it as a functi...
Valerie Hyde, Wolfgang Jank, Galit Shmueli
GECCO
2009
Springer
141views Optimization» more  GECCO 2009»
14 years 3 months ago
Distributed hyper-heuristics for real parameter optimization
Hyper-heuristics (HHs) are heuristics that work with an arbitrary set of search operators or algorithms and combine these algorithms adaptively to achieve a better performance tha...
Marco Biazzini, Balázs Bánhelyi, Alb...
ICDM
2003
IEEE
158views Data Mining» more  ICDM 2003»
14 years 2 months ago
Combining Multiple Weak Clusterings
A data set can be clustered in many ways depending on the clustering algorithm employed, parameter settings used and other factors. Can multiple clusterings be combined so that th...
Alexander P. Topchy, Anil K. Jain, William F. Punc...
MMS
2006
13 years 8 months ago
View-invariant motion trajectory-based activity classification and recognition
Motion trajectories provide rich spatio-temporal information about an object's activity. The trajectory information can be obtained using a tracking algorithm on data streams ...
Faisal I. Bashir, Ashfaq A. Khokhar, Dan Schonfeld