Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
162 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Activatability for simulation tractability of NP problems: Application to Ecology (0906.4454v1)

Published 24 Jun 2009 in q-bio.QM and cs.CE

Abstract: Dynamics of biological-ecological systems is strongly depending on spatial dimensions. Most of powerful simulators in ecology take into account for system spatiality thus embedding stochastic processes. Due to the difficulty of researching particular trajectories, biologists and computer scientists aim at predicting the most probable trajectories of systems under study. Doing that, they considerably reduce computation times. However, because of the largeness of space, the execution time remains usually polynomial in time. In order to reduce execution times we propose an activatability-based search cycle through the process space. This cycle eliminates the redundant processes on a statistical basis (Generalized Linear Model), and converges to the minimal number of processes required to match simulation objectives.

Summary

We haven't generated a summary for this paper yet.