Login / Signup
Candidate selection algorithms in opportunistic routing based on distance progress.
Amir Darehshoorzadeh
Llorenç Cerdà-Alabern
Vicent Pla
Published in:
Int. J. Ad Hoc Ubiquitous Comput. (2015)
Keyphrases
</>
orders of magnitude
learning algorithm
theoretical analysis
recently developed
computational complexity
significant improvement
optimization problems
computationally efficient
data structure
computational efficiency
computationally expensive
reinforcement learning
worst case
distance measure