Sciweavers

191 search results - page 3 / 39
» The basic feasible functionals in computable analysis
Sort
View
ICALP
2004
Springer
13 years 11 months ago
An Analog Characterization of Elementarily Computable Functions over the Real Numbers
Abstract We present an analog and machine-independent algebraic characterization of elementarily computable functions over the real numbers in the sense of recursive analysis: we p...
Olivier Bournez, Emmanuel Hainry
NC
1998
13 years 7 months ago
An Addition to Backpropagation for Computing Functional Roots
Many processes are composed of a n-fold repetition of some simpler process. If the whole process can be modeled with a neural network, we present a method to derive a model of the...
Lars Kindermann
WSC
2004
13 years 7 months ago
Poly-Functional Intelligent Agents for Computer Generated Forces
The authors present the requirement definition and methodological approach for developing a new generation of Computer Generated Forces (CGF) based on Intelligent Agents. The anal...
Matteo Brandolini, Attilio Rocca, Agostino G. Bruz...
SIGGRAPH
1992
ACM
13 years 9 months ago
Interval analysis for computer graphics
This paper discusses how interval analysis can be used to solve a wide variety of problems in computer graphics. These problems include ray tracing, interference detection, polygo...
John M. Snyder
FUIN
2006
89views more  FUIN 2006»
13 years 5 months ago
Recursive Analysis Characterized as a Class of Real Recursive Functions
Recently, using a limit schema, we presented an analog and machine independent algebraic characterization of elementary functions over the real numbers in the sense of recursive a...
Olivier Bournez, Emmanuel Hainry