7840 search results - page 341 / 1568 » On generalized Ramsey numbers |
191
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
229
click to vote
STOC
2004
ACM
16 years 7 months ago
2004
ACM
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
166
click to vote
ESA
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We study an extensive class of movement minimization problems which arise from many practical scenarios but so far have little theoretical study. In general, these proble...
166
click to vote
FSTTCS
2009
Springer
16 years 1 months ago
2009
Springer
We introduce and study the donation center location problem, which has an additional application in network testing and may also be of independent interest as a general graph-theor...
232
click to vote
APCSAC
2007
IEEE
16 years 1 months ago
2007
IEEE
Although they have been the main server technology for many years, multiprocessors are undergoing a renaissance due to multi-core chips and the attractive scalability properties of...