2957 search results - page 199 / 592 » The Complexity of Polynomial-Time Approximation |
169
click to vote
SPAA
2006
ACM
16 years 6 days ago
2006
ACM
Consider a network in which a collection of source nodes maintain and periodically update data objects for a collection of sink nodes, each of which periodically accesses the data...
197
click to vote
AINA
2005
IEEE
15 years 12 months ago
2005
IEEE
A core-based group-shared multicast tree is a shortest path tree rooted at core node that distributes packets to and from all group members. Traditionally, the bandwidth cost cons...
166
click to vote
INFOCOM
2005
IEEE
15 years 12 months ago
2005
IEEE
— In this paper, we propose to address the energy efficient routing problem in multi-hop wireless networks with accumulative relay. In the accumulative relay model, partially ov...
168
click to vote
ATAL
2005
Springer
15 years 11 months ago
2005
Springer
Agents or agent teams deployed to assist humans often face the challenges of monitoring the state of key processes in their environment (including the state of their human users t...
181
click to vote
SPAA
2004
ACM
15 years 11 months ago
2004
ACM
In this paper, we examine the problem of large-volume data dissemination via overlay networks. A natural way to maximize the throughput of an overlay multicast session is to split...