A Scalable Algorithm for Dispersing Population

Govindarajan, Sathish; Dietze, Michael C.; Agarwal, Pankaj K.; Clark, James S.

doi:10.1007/s10844-006-0030-z

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

タグ情報を表示リリース履歴を表示詳細要約

公開

学術論文

A Scalable Algorithm for Dispersing Population

MPS-Authors

/persons/resource/persons44512

Govindarajan, Sathish
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

There are no locators available

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

フルテキスト (公開)

公開されているフルテキストはありません

付随資料 (公開)

There is no public supplementary material available

引用

Govindarajan, S., Dietze, M. C., Agarwal, P. K., & Clark, J. S. (2007). A Scalable Algorithm for Dispersing Population. Journal of Intelligent Information Systems, 29(1), 39-61. doi:10.1007/s10844-006-0030-z.

引用: https://hdl.handle.net/11858/00-001M-0000-000F-1E35-7

要旨

Models of forest ecosystems are needed to understand how climate and land-use change can impact biodiversity. In this paper we describe an ecological dispersal model developed for the specific case of predicting seed dispersal by trees on a landscape for use in a forest simulation model. We present efficient approximation algorithms for computing seed dispersal. These algorithms allow us to simulate large landscapes for long periods of time. We also present experimental results that (1) quantify the inherent uncertainty in the dispersal model and (2) describe the variation of the approximation error as a function of the approximation parameters. Based on these experiments, we provide guidelines for choosing the right approximation parameters, for a given model simulation.