1208 search results - page 43 / 242 » Uniform eventown problems |
108
click to vote
JDA
2010
15 years 2 months ago
2010
Cars have to be painted in two colors in a sequence where each car occurs twice; assign the two colors to the two occurrences of each car so as to minimize the number of color chan...
115
click to vote
DSN
2002
IEEE
15 years 9 months ago
2002
IEEE
This paper shows that, in an environment where we do not bound the number of faulty processes, the class P of Perfect failure detectors is the weakest (among realistic failure det...
127
click to vote
IPL
2006
15 years 4 months ago
2006
We consider the online scheduling problem with m - 1, m 2, uniform machines each with a processing speed of 1, and one machine with a speed of s, 1 s 2, to minimize the makespa...
114
click to vote
SIAMJO
2008
15 years 4 months ago
2008
We show that the optimal complexity of Nesterov's smooth first-order optimization algorithm is preserved when the gradient is only computed up to a small, uniformly bounded er...
125
click to vote
DCG
2000
15 years 3 months ago
2000
Several polynomials are of use in various enumeration problems concerning objects in oriented matroids. Chief among these is the Radon catalog. We continue to study these, as well ...