3192 search results - page 365 / 639 » The minimum latency problem |
127
click to vote
DIALM
2004
ACM
15 years 10 months ago
2004
ACM
Orthogonal Variable Spreading Factor (OVSF) CDMA code consists of an infinite number of codewords with variable rates, in contrast to the conventional orthogonal fixed-spreading...
128
click to vote
SPAA
2003
ACM
15 years 9 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...
148
click to vote
COCOON
2003
Springer
15 years 9 months ago
2003
Springer
In this paper, we approach the quality of a greedy algorithm for the maximum weighted clique problem from the viewpoint of matroid theory. More precisely, we consider the clique c...
149
click to vote
INFOCOM
2002
IEEE
15 years 9 months ago
2002
IEEE
A multigigabit IP router may receive several millions packets per second from each input link. For each packet, the router needs to find the longest matching prefix in the forw...
156
click to vote
INFOCOM
2002
IEEE
15 years 9 months ago
2002
IEEE
Abstract— In this paper, we address the problem of providing traffic quality of service and energy efficiency in ad hoc wireless networks. We consider a network that is shared ...