Loading...
Beware greedy algorithms
To fairly compare the nestedness of ecological networks, a network's observed nestedness can be divided by its maximum nestedness. The authors show that a greedy algorithm does not find networks’ maximum nestedness values. Simulated annealing achieved much better results, laying the foundation...
Na minha lista:
| Udgivet i: | J Anim Ecol |
|---|---|
| Main Authors: | , , |
| Format: | Artigo |
| Sprog: | Inglês |
| Udgivet: |
John Wiley and Sons Inc.
2019
|
| Fag: | |
| Online adgang: | https://ncbi.nlm.nih.gov/pmc/articles/PMC6850377/ https://ncbi.nlm.nih.gov/pubmed/30874298 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1111/1365-2656.12963 |
| Tags: |
Tilføj Tag
Ingen Tags, Vær først til at tagge denne postø!
|