Sciweavers

154 search results - page 17 / 31
» Cobham recursive set functions
Sort
View
DM
2007
83views more  DM 2007»
13 years 7 months ago
Restricted colored permutations and Chebyshev polynomials
Several authors have examined connections between restricted permutations and Chebyshev polynomials of the second kind. In this paper we prove analogues of these results for color...
Eric S. Egge
VISSYM
2003
13 years 9 months ago
Adaptive Smooth Scattered Data Approximation for Large-scale Terrain Visualization
We present a fast method that adaptively approximates large-scale functional scattered data sets with hierarchical B-splines. The scheme is memory efficient, easy to implement an...
Martin Bertram, Xavier Tricoche, Hans Hagen
ATVA
2009
Springer
172views Hardware» more  ATVA 2009»
14 years 2 months ago
Symbolic CTL Model Checking of Asynchronous Systems Using Constrained Saturation
Abstract. The saturation state-space generation algorithm has demonstrated clear improvements over state-of-the-art symbolic methods for asynchronous systems. This work is motivate...
Yang Zhao, Gianfranco Ciardo
FSS
2008
127views more  FSS 2008»
13 years 7 months ago
On the computing power of fuzzy Turing machines
We work with fuzzy Turing machines (FTMs) and we study the relationship between this computational model and classical recursion concepts such as computable functions, recursively...
Benjamín René Callejas Bedregal, San...
CORR
2010
Springer
204views Education» more  CORR 2010»
13 years 6 months ago
Predictive State Temporal Difference Learning
We propose a new approach to value function approximation which combines linear temporal difference reinforcement learning with subspace identification. In practical applications...
Byron Boots, Geoffrey J. Gordon