6939 search results - page 964 / 1388 » Algorithm Engineering for Parallel Computation |
146
click to vote
COCO
2007
Springer
16 years 17 days ago
2007
Springer
We consider the problem of counting the number of spanning trees in planar graphs. We prove tight bounds on the complexity of the problem, both in general and especially in the mo...
151
click to vote
EUROPAR
2007
Springer
16 years 17 days ago
2007
Springer
Abstract. We investigate the following very simple load-balancing algorithm on the N-cycle (N even) which we call Odd-Even Transposition Balancing (OETB). The edges of the cycle ar...
175
Voted
EUROPAR
2004
Springer
15 years 11 months ago
2004
Springer
In hot-potato (deflection) routing, nodes in the network have no buffers for packets in transit, so that some conflicting packets must be deflected away from their destination...
156
Voted
GCC
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. In this paper, the resource availability issue has been addressed with respect to the intermittent connectivity and dynamic presence of peers in a P2P system. We aim to m...
164
click to vote
NPC
2004
Springer
15 years 11 months ago
2004
Springer
The complexity of services and applications provided by Web sites is ever increasing as integration of traditional Web publishing sites with new paradigms, i.e., e-commerce. Each d...