Carregant...
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...
Guardat en:
| Publicat a: | J Anim Ecol |
|---|---|
| Autors principals: | , , |
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
John Wiley and Sons Inc.
2019
|
| Matèries: | |
| Accés en línia: | 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 |
| Etiquetes: |
Afegir etiqueta
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|