16430 search results - page 109 / 3286 » On Computable Tree Functions |
130
Voted
DISCO
1993
15 years 7 months ago
1993
The fastest known algorithms in classical algebra make use of signature functions. That is, reducing computation with formulae to computing with the integers modulo p, by substitut...
128
click to vote
PADL
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. A lightweight approach to debugging functional logic programs by observations is presented, implemented for the language Curry. The Curry Object Observation System (COOSy...
128
Voted
ICRA
2008
IEEE
15 years 10 months ago
2008
IEEE
— In this paper we present a polynomial Navigation Function (NF) for a sphere world that can be constructed almost locally, with partial knowledge of the environment. The present...
109
Voted
CMPB
2008
15 years 2 months ago
2008
Recently, in a series of papers, a method based on pseudo-values has been proposed for direct regression modeling of the survival function, the restricted mean and cumulative inci...
147
click to vote
ICFP
1998
ACM
15 years 7 months ago
1998
ACM
We present a purely functional implementation of the computational differentiation tools — the well known numeric (i.e., not symbolic) techniques which permit one to compute poin...