1204 search results - page 216 / 241 » Optimal Routing in a Small-World Network |
166
click to vote
MOBICOM
2009
ACM
16 years 15 days ago
2009
ACM
In the literature, asymptotic studies of multi-hop wireless network capacity often consider only centralized and deterministic TDMA (time-division multi-access) coordination schem...
185
click to vote
JSAC
2010
15 years 24 days ago
2010
Abstract--The continuously increasing complexity of communication networks and the increasing diversity and unpredictability of traffic demand has led to a consensus view that the ...
143
click to vote
SPAA
2004
ACM
15 years 11 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...
168
click to vote
FOCS
2000
IEEE
15 years 10 months ago
2000
IEEE
In many optimization problems, one seeks to allocate a limited set of resources to a set of individuals with demands. Thus, such allocations can naturally be viewed as vectors, wi...
161
click to vote
ATMOS
2007
15 years 7 months ago
2007
The optimal track allocation problem (OPTRA) is to find, in a given railway network, a conflict free set of train routes of maximum value. We study two types of integer programmi...