1578 search results - page 110 / 316 » Direct Routing: Algorithms and Complexity |
111
Voted
SPAA
2004
ACM
15 years 9 months ago
2004
ACM
Given two admission control algorithms that are cA-acceptcompetitive and cR-reject-competitive respectively, we give two ways to make an algorithm that is simultaneously O(cA)acce...
152
Voted
COMCOM
1998
15 years 3 months ago
1998
With the proliferation of multimedia group applications, the construction of multicast trees satisfying Quality of Service QoS requirements is becoming a problem of prime import...
121
Voted
PODC
2009
ACM
16 years 4 months ago
2009
ACM
Peer-to-peer systems rely on scalable overlay networks that enable efficient routing between its members. Hypercubic topologies facilitate such operations while each node only nee...
131
Voted
IPPS
2006
IEEE
15 years 9 months ago
2006
IEEE
Approximate string matching problem is a common and often repeated task in information retrieval and bioinformatics. This paper proposes a generic design of a programmable array p...
130
Voted
SIGCOMM
2006
ACM
15 years 9 months ago
2006
ACM
An understanding of the topological structure of the Internet is needed for quite a number of networking tasks, e.g., making decisions about peering relationships, choice of upstr...