Sciweavers

2335 search results - page 80 / 467
» Functional Differentiation of Computer Programs
Sort
View
107
Voted
MICAI
2007
Springer
15 years 8 months ago
On Reachability of Minimal Models of Multilattice-Based Logic Programs
In this paper some results are obtained regarding the existence and reachability of minimal fixed points for multiple-valued functions on a multilattice. The concept of inf-preser...
Jesús Medina, Manuel Ojeda-Aciego, Jorge Ru...
96
Voted
LICS
2007
IEEE
15 years 8 months ago
Relational Parametricity for Computational Effects
According to Strachey, a polymorphic program is parametric if it applies a uniform algorithm independently of the type instantiations at which it is applied. The notion of relatio...
Rasmus Ejlers Møgelberg, Alex Simpson
COMPUTING
2006
119views more  COMPUTING 2006»
15 years 2 months ago
Sparse Grids, Adaptivity, and Symmetry
Sparse grid methods represent a powerful and efficient technique for the representation and approximation of functions and particularly the solutions of partial differential equat...
Harry Yserentant
83
Voted
COMPUTING
2002
57views more  COMPUTING 2002»
15 years 2 months ago
Problem Dependent Generalized Prewavelets
In this paper, we present a new approach to construct robust multilevel algorithms for elliptic differential equations. The multilevel algorithms consist of multiplicative subspac...
Christoph Pflaum
123
Voted
GECCO
2006
Springer
161views Optimization» more  GECCO 2006»
15 years 5 months ago
The LEM3 implementation of learnable evolution model and its testing on complex function optimization problems
1 Learnable Evolution Model (LEM) is a form of non-Darwinian evolutionary computation that employs machine learning to guide evolutionary processes. Its main novelty are new type o...
Janusz Wojtusiak, Ryszard S. Michalski