๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An Algorithm for Discovery

โœ Scribed by Paydarfar, D.


Book ID
121163592
Publisher
American Association for the Advancement of Science
Year
2001
Tongue
English
Weight
218 KB
Volume
292
Category
Article
ISSN
0036-8075

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


An Iterative Algorithm for Motif Discove
โœ Fan, Yetian; Wu, Wei; Liu, Rongrong; Yang, Wenyu ๐Ÿ“‚ Article ๐Ÿ“… 2013 ๐Ÿ› Elsevier ๐ŸŒ English โš– 99 KB
An asynchronous neighbor discovery algor
โœ Steven A. Borbash; Anthony Ephremides; Michael J. McGlynn ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 580 KB

We consider the problem of determining, in a distributed, asynchronous and scalable manner, what nodes are ''neighbors'' in a wireless network. Neighbor discovery is an important enabler of network connectivity and energy conservation. An asynchronous, probabilistic neighbor discovery algorithm is p

Genetic Algorithms for Route Discovery
โœ Gelenbe, E.; Liu, P.; Laine, J. ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› IEEE ๐ŸŒ English โš– 240 KB