210 search results - page 8 / 42 » Excludability and Bounded Computational Capacity |
159
click to vote
WDAG
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...
118
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
One major open problem in network coding is to characterize the capacity region of a general multi-source multi-demand network. There are some existing computational tools for boun...
168
click to vote
TWC
2010
14 years 11 months ago
2010
Abstract--We develop a new metric for quantifying end-toend throughput in multihop wireless networks, which we term random access transport capacity, since the interference model p...
153
click to vote
CONEXT
2005
ACM
15 years 6 months ago
2005
ACM
Wireless Mesh Networks (WMNs) are an emerging architecture based on multi-hop transmission. ISPs considers WMNs as a potential future technology to offer broadband Internet acces...
136
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
The classical problem of reliable point-to-point digital communication is to achieve a low probability of error while keeping the rate high and the total power consumption small. ...