5785 search results - page 271 / 1157 » Approximability of Probability Distributions |
150
click to vote
ESA
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. We present a first constant performance guarantee for preemptive stochastic scheduling to minimize the sum of weighted completion times. For scheduling jobs with release ...
146
Voted
CCCG
2010
15 years 6 months ago
2010
We investigate experimentally the Domatic Partition (DP) problem, the Independent Domatic Partition (IDP) problem and the Idomatic partition problem in Random Geometric Graphs (RG...
120
Voted
GEOINFO
2003
15 years 6 months ago
2003
Abstract. One of the most important features in an urban geographic information system is the ability to locate addresses, in any form employed by the population, in a quick and ef...
116
click to vote
NIPS
2007
15 years 6 months ago
2007
Support Vector Machines (SVMs) suffer from a widely recognized scalability problem in both memory use and computational time. To improve scalability, we have developed a parallel ...
131
Voted
ISAAC
2004
Springer
15 years 10 months ago
2004
Springer
Assuming 3-SAT formulas are hard to refute with high probability, Feige showed approximation hardness results, among others for the max bipartite clique. We extend this result in t...