Sciweavers

75 search results - page 6 / 15
» Approximately Efficient Online Mechanism Design
Sort
View
TEC
2008
115views more  TEC 2008»
13 years 7 months ago
Function Approximation With XCS: Hyperellipsoidal Conditions, Recursive Least Squares, and Compaction
An important strength of learning classifier systems (LCSs) lies in the combination of genetic optimization techniques with gradient-based approximation techniques. The chosen app...
Martin V. Butz, Pier Luca Lanzi, Stewart W. Wilson
PKDD
2010
Springer
179views Data Mining» more  PKDD 2010»
13 years 5 months ago
Gaussian Processes for Sample Efficient Reinforcement Learning with RMAX-Like Exploration
Abstract. We present an implementation of model-based online reinforcement learning (RL) for continuous domains with deterministic transitions that is specifically designed to achi...
Tobias Jung, Peter Stone
CIKM
2010
Springer
13 years 5 months ago
Online stratified sampling: evaluating classifiers at web-scale
Deploying a classifier to large-scale systems such as the web requires careful feature design and performance evaluation. Evaluation is particularly challenging because these larg...
Paul N. Bennett, Vitor R. Carvalho
OSDI
1996
ACM
13 years 8 months ago
Online Data-Race Detection via Coherency Guarantees
We present the design and evaluation of an on-thefly data-race-detection technique that handles applications written for the lazy release consistent (LRC) shared memory model. We ...
Dejan Perkovic, Peter J. Keleher
WINE
2010
Springer
153views Economy» more  WINE 2010»
13 years 5 months ago
Approximation Schemes for Sequential Posted Pricing in Multi-unit Auctions
We design algorithms for computing approximately revenue-maximizing sequential postedpricing mechanisms (SPM) in K-unit auctions, in a standard Bayesian model. A seller has K copi...
Tanmoy Chakraborty, Eyal Even-Dar, Sudipto Guha, Y...