Sciweavers

57 search results - page 10 / 12
» Abstraction carrying code and resource-awareness
Sort
View
CADE
2001
Springer
14 years 6 months ago
More On Implicit Syntax
Proof assistants based on type theories, such as Coq and Lego, allow users to omit subterms on input that can be inferred automatically. While those mechanisms are well known, ad-h...
Marko Luther
ADAEUROPE
2009
Springer
14 years 1 months ago
An Experience on Ada Programming Using On-Line Judging
Abstract. Ada has proved to be one of the best languages to learn computer programming. Nevertheless, learning to program is difficult and when it is combined with lack of motivati...
Francisco J. Montoya-Dato, José Luis Fern&a...
ALT
1999
Springer
13 years 11 months ago
On the Uniform Learnability of Approximations to Non-Recursive Functions
Abstract. Blum and Blum (1975) showed that a class B of suitable recursive approximations to the halting problem is reliably EX-learnable. These investigations are carried on by sh...
Frank Stephan, Thomas Zeugmann
IJPP
2010
137views more  IJPP 2010»
13 years 5 months ago
Parallel Option Price Valuations with the Explicit Finite Difference Method
Abstract. We show how computations such as those involved in American or European-style option price valuations with the explicit finite difference method can be performed in par...
Alexandros V. Gerbessiotis
ABIALS
2008
Springer
14 years 29 days ago
Anticipative Control of Voluntary Action: Towards a Computational Model
Abstract. Human action is goal-directed and must thus be guided by anticipations of wanted action effects. How anticipatory action control is possible and how it can emerge from ex...
Pascal Haazebroek, Bernhard Hommel