1760 search results - page 7 / 352 » Connected Set Cover Problem and Its Applications |
SPAA
1993
ACM
13 years 11 months ago
1993
ACM
In this paper we introduce the ConSet communication model for distributed memory parallel computers. The communication needs of an application program can be satisfied by some ar...
ICCAD
1997
IEEE
13 years 11 months ago
1997
IEEE
We introduce a new technique to solve exactly a discrete optimization problem, based on the paradigm of “negative” thinking. The motivation is that when searching the space of...
ESA
2005
Springer
14 years 1 months ago
2005
Springer
We present a simple two-person Bucket Game, based on throwing balls into buckets, and we discuss possible players’ strategies. We use these strategies to create an approximation ...
FOCS
2002
IEEE
14 years 17 days 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...
ICML
2001
IEEE
14 years 8 months ago
2001
IEEE
We generalize the classical algorithms of Valiant and Haussler for learning conjunctions and disjunctions of Boolean attributes to the problem of learning these functions over arb...