Sciweavers

4757 search results - page 130 / 952
» Monads for Functional Programming
Sort
View
MICAI
2007
Springer
16 years 14 days 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...
ESANN
2006
15 years 7 months ago
Reducing policy degradation in neuro-dynamic programming
We focus on neuro-dynamic programming methods to learn state-action value functions and outline some of the inherent problems to be faced, when performing reinforcement learning in...
Thomas Gabel, Martin Riedmiller
FSTTCS
2008
Springer
15 years 7 months ago
Analyzing the Implicit Computational Complexity of object-oriented programs
A sup-interpretation is a tool which provides upper bounds on the size of the values computed by the function symbols of a program. Sup-interpretations have shown their interest to...
Jean-Yves Marion, Romain Péchoux
GECCO
2009
Springer
109views Optimization» more  GECCO 2009»
16 years 27 days ago
Canonical representation genetic programming
Search spaces sampled by the process of Genetic Programming often consist of programs which can represent a function in many different ways. Thus, when the space is examined it i...
John R. Woodward, Ruibin Bai
WCFLP
2005
ACM
15 years 12 months ago
Lightweight program specialization via dynamic slicing
Program slicing is a well-known technique that extracts from a program those statements which are relevant to a particular criterion. While static slicing does not consider any in...
Claudio Ochoa, Josep Silva, Germán Vidal