5592 search results - page 463 / 1119 » On Random Betweenness Constraints |
192
click to vote
TSP
2008
15 years 6 months ago
2008
A random access protocol named ALLIANCES was recently proposed, that achieves high throughput by resolving collisions in wireless networks. ALLIANCES exploits diversity provided b...
165
click to vote
JSAC
2007
15 years 6 months ago
2007
—This paper derives the optimal search time and the optimal search cost that can be achieved in unstructured peer-topeer networks when the demand pattern exhibits clustering (i.e...
166
click to vote
TWC
2008
15 years 6 months ago
2008
We consider a wireless ad-hoc network with random ALOHA transmissions between nodes. However nodes can decide to use the Request-to-Send (RTS) / Clear-to-Send (CTS) protocol for oc...
154
click to vote
ENTCS
2002
15 years 6 months ago
2002
Solovay showed that there are noncomputable reals such that H( n) H(1n) + O(1), where H is prefix-free Kolmogorov complexity. Such H-trivial reals are interesting due to the conn...
181
click to vote
NN
2000
Springer
15 years 6 months ago
2000
Springer
We present the theoretical results about the construction of confidence intervals for a nonlinear regression based on least squares estimation and using the linear Taylor expansio...