462 search results - page 51 / 93 » Function Types in Complete Type Inference |
ENTCS
2007
13 years 7 months ago
2007
We present a technique for inducing functional programs from few, well chosen input/output-examples (I/Oexamples). Potential applications for automatic program or algorithm induct...
CATS
2006
13 years 9 months ago
2006
The busy beaver is an example of a function which is not computable. It is based on a particular class of Turing machines, and is defined as the largest number of 1's that ca...
AMAI
2004
Springer
13 years 7 months ago
2004
Springer
Sequential von Neumann-Morgernstern (VM) games are a very general formalism for representing multi-agent interactions and planning problems in a variety of types of environments. ...
IPCV
2010
13 years 5 months ago
2010
Abstract-- Different models for computing the spatial relations have been developed in the last decade. Separate methods are used for computing topological, directional and distanc...
SSDBM
1994
IEEE
13 years 11 months ago
1994
IEEE
The analysis of time series is a central issue in economic research and many other scientific applications. However, the data management functionality for this field is not provid...