Nalaganje...
Optimal random search using limited spatial memory
Lévy walks are known to be efficient movements because Lévy walkers search wide areas while restricting returns to previously visited sites. A self-avoiding walk (SAW) is a series of moves on a lattice that visit the same place only once. As such, SAWs can also be effective search algorithms. Howeve...
Shranjeno v:
| izdano v: | R Soc Open Sci |
|---|---|
| Main Authors: | , |
| Format: | Artigo |
| Jezik: | Inglês |
| Izdano: |
The Royal Society Publishing
2018
|
| Teme: | |
| Online dostop: | https://ncbi.nlm.nih.gov/pmc/articles/PMC5882669/ https://ncbi.nlm.nih.gov/pubmed/29657745 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1098/rsos.171057 |
| Oznake: |
Označite
Brez oznak, prvi označite!
|