8647 search results - page 548 / 1730 » The Container Selection Problem |
175
click to vote
JACM
1998
15 years 6 months ago
1998
Given a collection Ᏺ of subsets of S ϭ {1, . . . , n}, set cover is the problem of selecting as few as possible subsets from Ᏺ such that their union covers S, and max k-cover ...
180
click to vote
INFOCOM
2010
IEEE
15 years 5 months ago
2010
IEEE
We study the problem of finding the least-priced path (LPP) between a source and a destination in opportunistic spectrum access (OSA) networks. This problem is motivated by econo...
245
click to vote
AI
2011
Springer
15 years 2 months ago
2011
Springer
The ability to achieve one’s goals is a defining characteristic of intelligent behaviour. A great many existing theories, systems and research programmes address the problems a...
186
click to vote
ICC
2007
IEEE
16 years 1 months ago
2007
IEEE
— In this paper, we investigate the problem of grouping the sensor nodes into clusters to enhance the overall scalability of the network. A selected set of nodes, known as gatewa...
178
click to vote
DATE
2000
IEEE
15 years 11 months ago
2000
IEEE
We address the problem of inserting repeaters, selected from a library, at feasible locations in a placed and routed network to meet user-specified delay constraints. We use mini...