16404 search results - page 628 / 3281 » A set coverage problem |
190
click to vote
FCT
2007
Springer
15 years 11 months ago
2007
Springer
We study the multi-dimensional version of the bin packing problem with conflicts. We are given a set of squares V = {1, 2, . . . , n} with sides s1, s2, . . . , sn [0, 1] and a co...
195
click to vote
MOBICOM
2004
ACM
16 years 17 days ago
2004
ACM
The wide-scale deployment of IEEE 802.11 wireless networks has generated significant challenges for Information Technology (IT) departments in corporations. Users frequently comp...
173
click to vote
ECAI
1994
Springer
15 years 11 months ago
1994
Springer
We introduce the multiple capacitated job shop scheduling problem as a generalization of the job shop scheduling problem. In this problem machines may process several operations s...
165
click to vote
SODA
2000
ACM
15 years 8 months ago
2000
ACM
We study the edge-disjoint escape problem in grids. Given a set of n sources in a two-dimensional grid, the problem is to connect all sources to the grid boundary using a set of n...
157
click to vote
MOBIHOC
2006
ACM
16 years 6 months ago
2006
ACM
Using a dominating set as a coordinator in wireless networks has been proposed in many papers as an energy conservation technique. Since the nodes in a dominating set have the ext...