169 search results - page 33 / 34 » On the Number of t-Ary Trees with a Given Path Length |
MOBICOM
2005
ACM
13 years 12 months ago
2005
ACM
One of the challenging tasks in the deployment of dense wireless networks (like sensor networks) is in devising a routing scheme for node to node communication. Important consider...
WG
1998
Springer
13 years 10 months ago
1998
Springer
In this work we introduce the class of graphs with bounded induced distance of order k, (BID(k) for short). A graph G belongs to BID(k) if the distance between any two nodes in ev...
CONCUR
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. Graph games of infinite length provide a natural model for open reactive systems: one player (Eve) represents the controller and the other player (Adam) represents the en...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
tigate the role of nondeterminism in Winfree's abstract Tile Assembly Model (aTAM), which was conceived to model artificial molecular self-assembling systems constructed from...
MOBIHOC
2007
ACM
14 years 5 months ago
2007
ACM
Existing work on the capacity of wireless networks predominantly considers homogeneous random networks with random work load. The most relevant bounds on the network capacity, e.g...