5580 search results - page 730 / 1116 » Randomized priority algorithms |
124
Voted
WWW
2008
ACM
16 years 4 months ago
2008
ACM
We consider the budget-constrained bidding optimization problem for sponsored search auctions, and model it as an online (multiple-choice) knapsack problem. We design both determi...
130
Voted
WWW
2008
ACM
16 years 4 months ago
2008
ACM
We study the Cost-Per-Action or Cost-Per-Acquisition (CPA) charging scheme in online advertising. In this scheme, instead of paying per click, the advertisers pay only when a user...
134
click to vote
WWW
2004
ACM
16 years 4 months ago
2004
ACM
In ongoing research, a collaborative peer network application is being proposed to address the scalability limitations of centralized search engines. Here we introduce a local ada...
159
click to vote
EWSN
2009
Springer
16 years 4 months ago
2009
Springer
Abstract. In their EWSN'07 paper [1], Giusti et al. proposed a decentralized wake-up scattering algorithm for temporally spreading the intervals in which the nodes of a wirele...
172
Voted
KDD
2007
ACM
16 years 4 months ago
2007
ACM
A wide variety of machine learning problems can be described as minimizing a regularized risk functional, with different algorithms using different notions of risk and different r...