3019 search results - page 100 / 604 » Approximating the Domatic Number |
ECCC
2000
14 years 11 months ago
2000
We consider the problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is xed. We address the standard problem of minimizing the ...
104
click to vote
PODS
1999
ACM
15 years 4 months ago
1999
ACM
We investigate the problem of how to extend constraint query languages with aggregate operators. We deal with standard relational aggregation, and also with aggregates speci c to ...
FOCS
1999
IEEE
15 years 4 months ago
1999
IEEE
We show that the minimum distance of a linear code is not approximable to within any constant factor in random polynomial time (RP), unless nondeterministic polynomial time (NP) eq...
116
click to vote
TROB
2010
14 years 10 months ago
2010
—Robotic systems need to be able to plan control actions that are robust to the inherent uncertainty in the real world. This uncertainty arises due to uncertain state estimation,...
90
Voted
COCOON
2010
Springer
15 years 4 months ago
2010
Springer
We study algorithms for clustering data that were recently proposed by Balcan, Blum and Gupta in SODA’09 [4] and that have already given rise to two follow-up papers. The input f...