2168 search results - page 372 / 434 » Randomized Algorithms and Complexity Theory |
108
click to vote
TSP
2008
15 years 2 months ago
2008
The data of interest are assumed to be represented as N-dimensional real vectors, and these vectors are compressible in some linear basis B, implying that the signal can be recons...
100
click to vote
JCB
1998
15 years 2 months ago
1998
We introduce a new model of molecular computation that we call the sticker model. Like many previous proposals it makes use of DNA strands as the physical substrate in which infor...
128
click to vote
MOBIHOC
2007
ACM
16 years 2 months ago
2007
ACM
We consider distributed opportunistic scheduling (DOS) in wireless ad-hoc networks, where many links contend for the same channel using random access. In such networks, distribute...
145
click to vote
WDAG
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. We adapt the compact routing scheme by Thorup and Zwick to optimize it for power-law graphs. We analyze our adapted routing scheme based on the theory of unweighted rando...
138
click to vote
COCOON
2009
Springer
15 years 9 months ago
2009
Springer
: Network games play a fundamental role in understanding behavior in many domains, ranging from communication networks through markets to social networks. Such networks are used, a...