1034 search results - page 107 / 207 » Competitive generalized auctions |
107
Voted
AAAI
2010
15 years 19 days ago
2010
Different solvers for computationally difficult problems such as satisfiability (SAT) perform best on different instances. Algorithm portfolios exploit this phenomenon by predicti...
138
Voted
WWW
2009
ACM
16 years 3 months ago
2009
ACM
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...
115
click to vote
STOC
2010
ACM
15 years 7 months ago
2010
ACM
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...
139
Voted
ICML
2007
IEEE
16 years 3 months ago
2007
IEEE
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 ...
95
Voted
ICIAP
2005
ACM
16 years 2 months ago
2005
ACM
Abstract. Combining different algorithms submitted to the Third International Fingerprint Verification Competition (FVC2004) is studied. For this work, the matching results of more...