4894 search results - page 674 / 979 » The Guarding Problem - Complexity and Approximation |
123
click to vote
CSR
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. How could one estimate the total number of clicks a new advertisement could potentially receive in the current market? This question, called the click volume estimation p...
124
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
In this paper, we consider the mechanism design version of the fractional variant of the scheduling problem on unrelated machines. We give a lower bound of 2 − 1/n for any fracti...
129
click to vote
IFIP
2007
Springer
15 years 10 months ago
2007
Springer
The paper deals with the numerical treatment of optimal control problems with bounded distributed controls and elliptic state equations by a wider class of barrier-penalty methods...
114
click to vote
ISAAC
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Let C be a polygonal cycle on n vertices in the plane. A randomized algorithm is presented which computes in O(n log3 n) expected time, the edge of C whose removal result...
119
click to vote
ISAAC
2007
Springer
15 years 10 months ago
2007
Springer
In this paper, we consider the problem of partitioning a small data sample drawn from a mixture of k product distributions. We are interested in the case that individual features a...