Sciweavers

1806 search results - page 297 / 362
» Randomness and halting probabilities
Sort
View
JCT
2007
150views more  JCT 2007»
14 years 11 months ago
On the degree distribution of the nodes in increasing trees
Abstract. Simple families of increasing trees can be constructed from simply generated tree families, if one considers for every tree of size n all its increasing labellings, i.e.,...
Markus Kuba, Alois Panholzer
109
Voted
JPDC
2007
112views more  JPDC 2007»
14 years 11 months ago
Distributed algorithms for connected domination in wireless networks
We present fast distributed local control Connected Dominating Set (CDS) algorithms for wireless ad hoc networks. We present two randomized distributed algorithms, CDSColor and CD...
Rajiv Gandhi, Srinivasan Parthasarathy 0002
JSAC
2007
139views more  JSAC 2007»
14 years 11 months ago
Reverse-Engineering MAC: A Non-Cooperative Game Model
— This paper reverse-engineers backoff-based random-access MAC protocols in ad-hoc networks. We show that the contention resolution algorithm in such protocols is implicitly part...
Jang-Won Lee, Ao Tang, Jianwei Huang, Mung Chiang,...
TVLSI
2008
151views more  TVLSI 2008»
14 years 11 months ago
Guest Editorial Special Section on Design Verification and Validation
ion levels. The framework also supports the generation of test constraints, which can be satisfied using a constraint solver to generate tests. A compositional verification approac...
I. Harris, D. Pradhan
TWC
2008
158views more  TWC 2008»
14 years 11 months ago
Transmission capacity of ad hoc networks with spatial diversity
This paper derives the outage probability and transmission capacity of ad hoc wireless networks with nodes employing multiple antenna diversity techniques, for a general class of ...
Andrew M. Hunter, Jeffrey G. Andrews, Steven Weber