575 search results - page 76 / 115 » Computing Maximum Subsequence in Parallel |
165
click to vote
IPPS
2007
IEEE
16 years 9 days ago
2007
IEEE
We define a proximity overlay network (PON) which allow to realize DHT systems whose aim is to combine routing efficiency – i.e. an optimal degree/diameter tradeoff – and pr...
162
click to vote
ICPP
2006
IEEE
16 years 1 days ago
2006
IEEE
— Due to resource scarcity, a paramount concern in ad hoc networks is to utilize the limited resources efficiently. The self-organized nature of ad hoc networks makes the social...
163
click to vote
IPPS
2005
IEEE
15 years 11 months ago
2005
IEEE
: A fundamental problem in communication networks is wavelength assignment (WA): given a set of routing paths on a network, assign a wavelength to each path such that the paths wit...
152
click to vote
SPAA
2003
ACM
15 years 11 months ago
2003
ACM
We consider an online version of the oblivious routing problem. Oblivious routing is the problem of picking a routing between each pair of nodes (or a set of ows), without knowled...
168
click to vote
ICPADS
2002
IEEE
15 years 11 months ago
2002
IEEE
Nowadays, the commonly used table lookup scheme for IP routing is based on the so-called classless interdomain routing (CIDR). With CIDR, routers must find out the best matching ...