14158 search results - page 276 / 2832 » Generalized switch-setting problems |
145
click to vote
ATAL
2005
Springer
15 years 9 months ago
2005
Springer
We examine whether and how the Multiagent Plan Coordination Problem, the problem of resolving interactions between the plans of multiple agents, can be cast as a Distributed Const...
122
click to vote
COCOON
2005
Springer
15 years 9 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 ...
128
click to vote
ICALP
2005
Springer
15 years 9 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...
141
click to vote
SWAT
2004
Springer
15 years 9 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...
146
click to vote
FOCS
2002
IEEE
15 years 9 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...