Sciweavers

1034 search results - page 107 / 207
» Competitive generalized auctions
Sort
View
AAAI
2010
13 years 8 months ago
Latent Class Models for Algorithm Portfolio Methods
Different solvers for computationally difficult problems such as satisfiability (SAT) perform best on different instances. Algorithm portfolios exploit this phenomenon by predicti...
Bryan Silverthorn, Risto Miikkulainen
WWW
2009
ACM
14 years 11 months ago
Adaptive bidding for display advertising
Motivated by the emergence of auction-based marketplaces for display ads such as the Right Media Exchange, we study the design of a bidding agent that implements a display adverti...
Arpita Ghosh, Benjamin I. P. Rubinstein, Sergei Va...
STOC
2010
ACM
194views Algorithms» more  STOC 2010»
14 years 3 months ago
Multi-parameter mechanism design and sequential posted pricing
We study the classic mathematical economics problem of Bayesian optimal mechanism design where a principal aims to optimize expected revenue when allocating resources to self-inte...
Shuchi Chawla, Jason Hartline, David Malec and Bal...
ICML
2007
IEEE
14 years 11 months ago
Gradient boosting for kernelized output spaces
A general framework is proposed for gradient boosting in supervised learning problems where the loss function is defined using a kernel over the output space. It extends boosting ...
Florence d'Alché-Buc, Louis Wehenkel, Pierr...
ICIAP
2005
ACM
14 years 10 months ago
Combining Multiple Matchers for Fingerprint Verification: A Case Study in FVC2004
Abstract. Combining different algorithms submitted to the Third International Fingerprint Verification Competition (FVC2004) is studied. For this work, the matching results of more...
Julian Fiérrez-Aguilar, Loris Nanni, Javier...