1768 search results - page 248 / 354 » Optimal routing in Chord |
COR
2006
15 years 1 months ago
2006
Home health care, i.e. visiting and nursing patients in their homes, is a growing sector in the medical service business. From a staff rostering point of view, the problem is to f...
104
click to vote
ATMOS
2010
15 years 17 days ago
2010
We study variants of the vertex disjoint paths problem in planar graphs where paths have to be selected from a given set of paths. We study the problem as a decision, maximization...
124
click to vote
INFOCOM
2010
IEEE
15 years 2 days ago
2010
IEEE
— In opportunistic networks, end-to-end paths between two communicating nodes are rarely available. In such situations, the nodes might still copy and forward messages to nodes t...
ICCD
2005
IEEE
15 years 10 months ago
2005
IEEE
The formal analysis of parallelism and pipelining is performed on an 8-bit Add-Compare-Select element of a Viterbi decoder. The results are quantified through a study of the delay...
105
click to vote
HM
2007
Springer
15 years 7 months ago
2007
Springer
For the NP-hard Optimum Communication Spanning Tree (OCST) problem a cost minimizing spanning tree has to be found, where the cost depends on the communication volume between each ...