Sciweavers

347 search results - page 17 / 70
» Computable Versions of Basic Theorems in Functional Analysis
Sort
View
GECCO
2003
Springer
127views Optimization» more  GECCO 2003»
15 years 5 months ago
Complex Function Sets Improve Symbolic Discriminant Analysis of Microarray Data
Abstract. Our ability to simultaneously measure the expression levels of thousands of genes in biological samples is providing important new opportunities for improving the diagnos...
David M. Reif, Bill C. White, Nancy Olsen, Thomas ...
ICONIP
1998
15 years 1 months ago
Computing Iterative Roots with Neural Networks
Many real processes are composed of a n-fold repetition of some simpler process. If the whole process can be modelled with a neural network, we present a method to derive a model ...
Lars Kindermann
ENTCS
2006
136views more  ENTCS 2006»
14 years 11 months ago
Classically-controlled Quantum Computation
It is reasonable to assume that quantum computations take place under the control of the classical world. For modelling this standard situation, we introduce a Classically-control...
Simon Perdrix, Philippe Jorrand
CSL
1999
Springer
15 years 4 months ago
Pre-logical Relations
Abstract. We study a weakening of the notion of logical relations, called prelogical relations, that has many of the features that make logical relations so useful but having furth...
Furio Honsell, Donald Sannella
AI
1998
Springer
14 years 11 months ago
What Robots Can Do: Robot Programs and Effective Achievability
In this paper, we propose a definition of goal achievability: given a basic action theory describing an initial state of the world and some primitive actions available to a robot...
Fangzhen Lin, Hector J. Levesque