91 search results - page 1 / 19 » Bounding the Size of k-Tuple Covers |
HICSS
2009
IEEE
13 years 11 months ago
2009
IEEE
Suppose there are n applications and n processors. A pair cover is a set S of one-to-one mappings (assignments) of the applications to the processors such that, for every pair (Ai...
DCC
2003
IEEE
14 years 4 months ago
2003
IEEE
COCOON
2001
Springer
13 years 9 months ago
2001
Springer
We consider one-dimensional and multi-dimensional vector covering with variable sized bins. In the one-dimensional case, we consider variable sized bin covering with bounded item ...
COCOA
2009
Springer
13 years 9 months ago
2009
Springer
Abstract. In wireless communication networks, optimal use of the directional antenna is very important. The directional antenna coverage (DAC) problem is to cover all clients with ...
FOCS
2008
IEEE
13 years 11 months ago
2008
IEEE
Relational joins are at the core of relational algebra, which in turn is the core of the standard database query language SQL. As their evaluation is expensive and very often domi...