2863 search results - page 170 / 573 » Constructing minimum-interference networks |
126
click to vote
WAOA
2005
Springer
15 years 9 months ago
2005
Springer
We study computational and coordination efficiency issues of Nash equilibria in symmetric network congestion games. We first propose a simple and natural greedy method that comput...
133
Voted
INFOCOM
2002
IEEE
15 years 8 months ago
2002
IEEE
Abstract— In [1], Gupta and Kumar determined the capacity of wireless networks under certain assumptions, among them point-to-point coding, which excludes for example multi-acces...
222
click to vote
NEUROSCIENCE
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. Finite-state machines are the most pervasive models of computation, not only in theoretical computer science, but also in all of its applications to real-life problems, a...
142
Voted
ICPP
1992
IEEE
15 years 7 months ago
1992
IEEE
Many routing problems in parallel processing, such as concentration and permutation problems, can be cast as sorting problems. In this paper, we consider the problem of sorting on ...
138
click to vote
CCGRID
2001
IEEE
15 years 7 months ago
2001
IEEE
Active networks allow computations to be performed innetwork at routers as messages pass through them. Active networks offer unique opportunities to optimize networkcentric applic...