14165 search results - page 202 / 2833 » The generalized two-server problem |
125
click to vote
TALG
2008
15 years 4 months ago
2008
Given a set of n elements, each of which is colored one of c 2 colors, we must determine an element of the plurality (most frequently occurring) color by pairwise equal/unequal co...
147
click to vote
IJCV
2000
15 years 4 months ago
2000
We present an algorithm to estimate the parameters of a linear model in the presence of heteroscedastic noise, i.e., each data point having a different covariance matrix. The algor...
118
click to vote
MP
2002
15 years 4 months ago
2002
In an unpublished paper, Araque, Hall and Magnanti considered polyhedra associated with the Capacitated Vehicle Routing Problem (CVRP) in the special case of unit demands. Among th...
114
click to vote
PODC
2009
ACM
15 years 11 months ago
2009
ACM
The (M, W)-controller, originally studied by Afek, Awerbuch, Plotkin, and Saks, is a basic distributed tool that an abstraction for managing the consumption of a global resource i...
110
click to vote
SPIRE
2004
Springer
15 years 9 months ago
2004
Springer
Given a set of strings U = {T1, T2, . . . , T }, the longest common repeat problem is to find the longest common substring that appears at least twice in each string of U. We als...