Search
Now showing items 521-530 of 607
Agenda 21, Education for Sustainabliity and School partnerships : Gardening a case study
(Register of Research in Primary Geography, 2004)
Comparing Different Prenexing Strategies for Quantified Boolean Formulas
(Springer Nature, 2004)
The majority of the currently available solvers for quantified Boolean formulas (QBFs) process input formulas only in prenex conjunctive normal form. However, the natural representation of practicably relevant problems in ...
The development and evaluation of a software prototype for computer adaptive testing
(2004)
This paper presents ongoing research at the University of Hertfordshire on the use of computer-adaptive tests (CATs) in Higher Education. A software prototype based on Item Response Theory has been developed and is described ...
Becoming Inflated
(2004)
Some have thought that the process of the expansion of the universe can be used to define an absolute ‘cosmic time’ which then serves as the absolute time required by tensed theories of time. Indeed, this is the very reason ...
Becoming a Client, Becoming a Practitioner : Student Narratives from a Dance Movement Therapy Group
(2004)
This paper documents one of several themes arising from a larger research study which invited trainees' views on their experience in a weekly, 2 year, dance movement therapy (DMT) personal development group. This group ...
In search of relevance : Is there an academic-practitioner divide in business-to-business marketing?
(2004)
This article reports on three related empirical studies of the relevance of academic research to management practice in the field of business-to-business marketing. These studies comprise a survey of 58 academic researchers, ...
Sensitivity of the C and O production on the 3 alpha rate
(2004)
We investigate the dependence of the carbon and oxygen production in stars on the 3alpha rate by varying the energy of the 0(2)(+)-state of (12)C and determine the resulting yields for a selection of low-mass, intermediate-mass ...
Approximation of Boolean Functions by Local Search
(2004)
Usually, local search methods are considered to be slow. In our paper, we present a simulated annealing-based local search algorithm for the approximation of Boolean functions with a proven time complexity that behaves ...