139 search results - page 6 / 28 » AdWords and generalized online matching |
WAOA
2004
Springer
15 years 2 months ago
2004
Springer
In competitive analysis, we usually do not put any restrictions on the computational complexity of online algorithms, although efficient algorithms are preferred. Thus if such an...
WAOA
2004
Springer
15 years 2 months ago
2004
Springer
We consider a non-preemptive, stochastic parallel machine scheduling model with the goal to minimize the weighted completion times of jobs. In contrast to the classical stochastic ...
65
Voted
WWW
2004
ACM
15 years 10 months ago
2004
ACM
Service matchmaking and composition has recently drawn increasing attention in the research community. Most existing algorithms construct chains of services based on exact matches...
MFCS
2005
Springer
15 years 3 months ago
2005
Springer
The online squarefree recognition problem is to detect the first occurrence of a square in a string whose characters are provided as input one at a time. We present an efficient a...
KDD
2009
ACM
15 years 4 months ago
2009
ACM
In this paper we propose a utility model that accounts for both sales and branding advertisers. We first study the computational complexity of optimization problems related to bo...