Sciweavers

3618 search results - page 116 / 724
» Additive functions for number systems in function fields
Sort
View
134
Voted
IFL
2001
Springer
137views Formal Methods» more  IFL 2001»
15 years 8 months ago
A Generic Programming Extension for Clean
Abstract. Generic programming enables the programmer to define functions by induction on the structure of types. Defined once, such a generic function can be used to generate a s...
Artem Alimarine, Marinus J. Plasmeijer
112
Voted
IFL
2005
Springer
103views Formal Methods» more  IFL 2005»
15 years 9 months ago
Accurate Step Counting
Abstract Starting with an evaluator for a language, an abstract machine for the same language can be mechanically derived using successive program transformations. This has relevan...
Catherine Hope, Graham Hutton
AMC
2008
157views more  AMC 2008»
15 years 4 months ago
On Popovski's method for nonlinear equations
ct 7 Two different modifications of Popovski's method are developed, both are free of second derivatives. In the first mod8 ified scheme we traded the second derivative by an ...
B. Neta
IJON
2006
131views more  IJON 2006»
15 years 4 months ago
Optimizing blind source separation with guided genetic algorithms
This paper proposes a novel method for blindly separating unobservable independent component (IC) signals based on the use of a genetic algorithm. It is intended for its applicati...
J. M. Górriz, Carlos García Puntonet...
124
Voted
CORR
2006
Springer
123views Education» more  CORR 2006»
15 years 4 months ago
Continuations, proofs and tests
Continuation Passing Style (CPS) is one of the most important issues in the field of functional programming languages, and the quest for a primitive notion of types for continuati...
Stefano Guerrini, Andrea Masini