Most free-living animals have finite energy stores that they must allocate to different physiological and behavioral processes. In times of energetic stress, trade-offs in energy allocation among these processes may occur. The manifestation of trade-offs may depend on the source (e.g., glucose, lipids) and severity of energy limitation. In this study, we investigated energetic trade-offs betwee...

This paper draws attention to project trade-offs significance in project management and critically reviews the current state of the knowledge on the elements to be considered and the methods to resolve trade-off decisions. Traditionally the elements to be considered in trade-offs are mainly limited to time and cost and to some extent quality or risk or the well-known Project Triangle. The trade...

A common way of reducing run time complexity of RDF Schema reasoning is to compute (parts of) the deductive closure of a model offline. This reduces the complexity at run time, but increases the space requirements and model maintenance because derivable facts have to be stored explicitly and checked for validity when the model is updated. In this paper we experimentally identify certain kinds o...

Given a set of numbers, the k-SUM problem asks for a subset of k numbers that sums to zero. When the numbers are integers, the time and space complexity of k-SUM is generally studied in the word-RAM model; when the numbers are reals, the complexity is studied in the real-RAM model, and space is measured by the number of reals held in memory at any point. We present a time and space efficient de...

We study space/time tradeoffs for querying some combinatorial structures. In the first, given an arrangement of n lines in general position in the plane, a query for a real number t asks about Rank(t), the number of vertices of the arrangement with x-coordinates ≤ t. We show that for K = O(n/logn), after a preprocessing step that uses space S = O(n/(K logK)) the query can be answered in time O(...

A model of visual apparent motion is derived from four observations on path selection in ambiguous displays in which apparent motion of illuminated dots could, in principle, be perceived along many possible paths: (a) Whereas motion over each path is clearly visible when its stimulus is presented in isolation, motion is usually seen over only one path when two or more such stimuli are combined ...

Let A(l),A(2),...,A(n) be an array which stores values in a commutative semi-group S. We are concerned with the design of data structures for representing the array A(i) which facilitate implementation of the range queries Retrieve(j, k) defined as follows. Retrieve(j, k) (l<j<k&n) Return i A(i). i=j An obvious data structure would be the array A(j) itself. This approach has the disadvantage th...

To which extend can we speak about time-space tradeoffs in the sense that, for a given problem, a faster algorithm requires more space than a slower algorithm? Furthermore, to which extend can we speak about such trade-offs in the context of parallel or neural computing? This paper aims to give an insight to these problems. The parallel computation thesis, first proposed in print in [Ch.S.76], ...

The Longest Common Substring problem is to compute the longest substring which occurs in at least d ≥ 2 of m strings of total length n. In this paper we ask the question whether this problem allows a deterministic time-space trade-off using O(n) time and O(n1−ε) space for 0 ≤ ε ≤ 1. We give a positive answer in the case of two strings (d = m = 2) and 0 < ε ≤ 1/3. In the general case where 2 ≤ d...

A possible route to managing workload peaks facilitated by advances in technology is to use Dynamic Function Allocation, in other words to design work so that it is possible to switch adaptively between levels of automation. In the main, current approaches to Dynamic Function Allocation assume that functions are to be serviced as soon as possible, and in order of arrival. These methods utilise ...