206 search results - page 11 / 42 » A branch-and-bound algorithm for hard multiple knapsack prob... |
INFOCOM
2010
IEEE
14 years 7 months ago
2010
IEEE
Abstract--Existing routing algorithms for Delay Tolerant Networks (DTNs) assume that nodes are willing to forward packets for others. In the real world, however, most people are so...
103
click to vote
ANCS
2008
ACM
14 years 11 months ago
2008
ACM
The significance of high-performance dedicated networks has been well recognized due to the rapidly increasing number of large-scale applications that require high-speed data tran...
AINA
2007
IEEE
15 years 4 months ago
2007
IEEE
— Wireless sensor networks are made up of hundreds of devices deployed over a distant or sensitive field to be monitored. Energy consumption is balanced by taking advantage of t...
CIAC
2006
Springer
15 years 1 months ago
2006
Springer
In the rectangle stabbing problem we are given a set of axis parallel rectangles and a set of horizontal and vertical lines, and our goal is to find a minimum size subset of lines...
CIC
2004
14 years 11 months ago
2004
Layered multicast is probably the most elegant solution to tackle the heterogene ity problem in multicast delivery of real-time multimedia streams. However, the multiple join expe...