Sciweavers

14704 search results - page 178 / 2941
» computing 2007
Sort
View
APAL
2007
88views more  APAL 2007»
15 years 3 months ago
Randomness and the linear degrees of computability
We show that there exists a real α such that, for all reals β, if α is linear reducible to β (α ≤ β, previously denoted α ≤sw β) then β ≤T α. In fact, every random ...
Andrew E. M. Lewis, George Barmpalias
BEHAVIOURIT
2007
98views more  BEHAVIOURIT 2007»
15 years 3 months ago
Methods for human - computer interaction research with older people
: Experimental research in human–computer interaction commonly uses participant groups that are unrepresentative of demographic realities, being young, technically knowledgeable ...
Anna Dickinson, John L. Arnott, Suzanne Prior
AML
2006
83views more  AML 2006»
15 years 3 months ago
The Medvedev lattice of computably closed sets
Simpson introduced the lattice P of 0 1 classes under Medvedev reducibility. Questions regarding completeness in P are related to questions about measure and randomness. We presen...
Sebastiaan Terwijn
CCE
2007
15 years 3 months ago
Reliable computation of equilibrium states and bifurcations in ecological systems analysis
A problem of frequent interest in analyzing nonlinear ODE models of ecological systems is the location of equilibrium states and bifurcations. Interval-Newton techniques are explo...
C. Ryan Gwaltney, Mark A. Stadtherr
AIR
2005
130views more  AIR 2005»
15 years 3 months ago
Framework for Task Scheduling in Heterogeneous Distributed Computing Using Genetic Algorithms
An algorithm has been developed to dynamically schedule heterogeneous tasks on heterogeneous processors in a distributed system. The scheduler operates in an environment with dynam...
Andrew J. Page, Thomas J. Naughton