1494 search results - page 258 / 299 » Polynomial time algorithms for network information flow |
CISS
2008
IEEE
14 years 3 months ago
2008
IEEE
— We study the problem of relay selection in a wireless cooperative network. Assuming a single source, a single destination, and N uniformly distributed candidate relays, we seek...
ICDCS
2008
IEEE
14 years 3 months ago
2008
IEEE
In today’s networked storage environment, it is common to have a hierarchy of caches where the lower levels of the hierarchy are accessed by multiple clients. This sharing can h...
MOBICOM
2000
ACM
14 years 1 months ago
2000
ACM
In satellite and wireless networks and in advanced traffic information systems in which the up-link bandwidth is very limited, a server broadcasts data files in a round-robin man...
AIPS
2010
13 years 9 months ago
2010
Efficient management and propagation of temporal constraints is important for temporal planning as well as for scheduling. During plan development, new events and temporal constra...
WWW
2007
ACM
14 years 9 months ago
2007
ACM
Peer-to-peer technologies are increasingly becoming the medium of choice for delivering media content, both professional and homegrown, to large user populations. Indeed, current ...