Sciweavers

16 search results - page 2 / 4
» Asymptotically Optimal Randomized Tree Embedding in Static N...
Sort
View
FSTTCS
1995
Springer
13 years 9 months ago
Branch and Bound on the Network Model
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...
Sanjay Jain
ICDCS
2003
IEEE
13 years 11 months ago
Neighbor Table Construction and Update in a Dynamic Peer-to-Peer Network
In a system proposed by Plaxton, Rajaraman and Richa (PRR), the expected cost of accessing a replicated object was proved to be asymptotically optimal for a static set of nodes an...
Huaiyu Liu, Simon S. Lam
FOCS
1995
IEEE
13 years 9 months ago
Disjoint Paths in Densely Embedded Graphs
We consider the following maximum disjoint paths problem (mdpp). We are given a large network, and pairs of nodes that wish to communicate over paths through the network — the g...
Jon M. Kleinberg, Éva Tardos
TPDS
2008
175views more  TPDS 2008»
13 years 5 months ago
Centralized versus Distributed Schedulers for Bag-of-Tasks Applications
Multiple applications that execute concurrently on heterogeneous platforms compete for CPU and network resources. In this paper, we consider the problem of scheduling applications ...
Olivier Beaumont, Larry Carter, Jeanne Ferrante, A...
JCIT
2008
129views more  JCIT 2008»
13 years 5 months ago
An Enhanced tree based MAODV Protocol for MANETs using Genetic Algorithm
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...
E. Baburaj, V. Vasudevan