5595 search results - page 1060 / 1119 » Approximation Algorithms for Clustering Problems |
141
click to vote
QUESTA
2010
15 years 3 months ago
2010
In a M/M/N+M queue, when there are many customers waiting, it may be preferable to reject a new arrival rather than risk that arrival later abandoning without receiving service. O...
129
click to vote
WINE
2010
Springer
15 years 2 months ago
2010
Springer
We study the optimal pricing strategies of a monopolist selling a divisible good (service) to consumers that are embedded in a social network. A key feature of our model is that c...
134
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Display ads on the Internet are increasingly sold via ad exchanges such as RightMedia, AdECN and Doubleclick Ad Exchange. These exchanges allow real-time bidding, that is, each ti...
178
click to vote
KDD
2012
ACM
13 years 7 months ago
2012
ACM
Multi-task learning (MTL) aims to improve the performance of multiple related tasks by exploiting the intrinsic relationships among them. Recently, multi-task feature learning alg...
223
click to vote
Book
"Gaussian processes (GPs) provide a principled, practical, probabilistic approach to learning in kernel machines. GPs have received increased attention in the machine-learning...