๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Simple aspects of foodweb complexity

โœ Scribed by N. MacDonald

Publisher
Elsevier Science
Year
1979
Tongue
English
Weight
654 KB
Volume
80
Category
Article
ISSN
0022-5193

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Formal aspects of egress complexity
Formal aspects of egress complexity
โœ H.A. Donegan; T.B.M. McMaster ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 742 KB

Egress complexity is concerned with the summative uncertainty experienced by a naive occupant of a building when faced with a challenge to evacuate without the assistance of signage. This paper takes the present model of egress complexity and recasts its basic initiative in terms of elementary order

Complexity of electrocortical dynamics i
Complexity of electrocortical dynamics in children: Developmental aspects
โœ Andrey P. Anokhin; Werner Lutzenberger; Andrey Nikolaev; Niels Birbaumer ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 414 KB ๐Ÿ‘ 2 views

Dimensional complexity (DCx) is an EEG measure derived from nonlinear systems theory that can be indicative of the global dynamical complexity of electrocortical activity. This study examined developmental changes in DCx, as well as the effects of cognitive tasks, gender, and brain topography, and c

The counting complexity of a simple sche
The counting complexity of a simple scheduling problem
โœ Gerardo Berbeglia ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 780 KB

Let T be a set of tasks. Each task has a non-negative processing time and a deadline. The problem of determining whether or not there is a schedule of the tasks in T such that a single machine can finish processing each of them before its deadline is polynomially solvable. We prove that counting the