298 search results - page 37 / 60 » Multicriteria Steiner Tree Problem for Communication Network |
INFOCOM
2008
IEEE
15 years 6 months ago
2008
IEEE
Abstract—Latency reduction in distributed interactive applications has been studied intensively. Such applications may have stringent latency requirements and dynamic user groups...
CPAIOR
2010
Springer
15 years 4 months ago
2010
Springer
Constrained Optimum Path (COP) problems arise in many real-life applications and are ubiquitous in communication networks. They have been traditionally approached by dedicated algo...
104
click to vote
FSTTCS
1995
Springer
15 years 3 months ago
1995
Springer
Karp and Zhang developed a general randomized parallel algorithm for solving branch and bound problems. They showed that with high probability their algorithm attained optimal spe...
127
click to vote
JCIT
2008
14 years 11 months ago
2008
Multicast routing protocols in Mobile Ad-hoc Networks (MANETs) are emerging for wireless group communication which includes application such as multipoint data dissemination and m...
175
click to vote
ISCA
2002
IEEE
14 years 11 months ago
2002
IEEE
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...