14386 search results - page 303 / 2878 » The Chinese Generals Problem |
126
Voted
COCOON
2005
Springer
15 years 10 months ago
2005
Springer
In the well-studied Majority problem, we are given a set of n balls colored with two or more colors, and the goal is to use the minimum number of color comparisons to find a ball ...
131
Voted
ICALP
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We generalize the k-means algorithm presented by the authors [14] and show that the resulting algorithm can solve a larger class of clustering problems that satisfy certa...
149
click to vote
SWAT
2004
Springer
15 years 10 months ago
2004
Springer
In this paper, we investigate the test set problem and its variations that appear in a variety of applications. In general, we are given a universe of objects to be “distinguish...
158
click to vote
FOCS
2002
IEEE
15 years 10 months ago
2002
IEEE
We consider the classical vertex cover and set cover problems with the addition of hard capacity constraints. This means that a set (vertex) can only cover a limited number of its...
148
click to vote
GECCO
2009
Springer
15 years 9 months ago
2009
Springer
Given a collection of terminals, each with a demand, a collection of concentrators, each with a capacity, and costs of connecting the terminals to the concentrators, the terminal ...