7150 search results - page 1338 / 1430 » An Approximation Algorithm for Approximation Rank |
122
click to vote
IM
2007
15 years 2 months ago
2007
— We consider whether the off-line compilation of a set of Service Level Agreements (SLAs) into low-level management policies can lead to the runtime maximization of the overall ...
124
Voted
SODA
2008
ACM
15 years 2 months ago
2008
ACM
This paper considers a general setting for structured procurement and the problem a buyer faces in designing a procurement mechanism to maximize profit. This brings together two a...
110
Voted
SODA
2001
ACM
15 years 2 months ago
2001
ACM
Consider an edge-weighted tree T = (V, E, w : E R+ ), in which a subset R of the nodes (called the required nodes) are colored red and the remaining nodes in S = V \R are colored ...
118
click to vote
IIS
2003
15 years 2 months ago
2003
Abstract. In this paper we consider the problem of web search results clustering in the Polish language, supporting our analysis with results acquired from an experimental system n...
88
Voted
IM
2003
15 years 2 months ago
2003
: Quantitative models are needed for a variety of management tasks, including (a) identification of critical variables to use for health monitoring, (b) anticipating service level...