1989 search results - page 225 / 398 » Set functions for functional logic programming |
133
click to vote
JCT
2011
14 years 10 months ago
2011
The f-regressive Ramsey number Rreg f (d, n) is the minimum N such that every colouring of the d-tuples of an N-element set mapping each x1, . . . , xd to a colour ≤ f(x1) contai...
139
click to vote
EUROGP
2005
Springer
15 years 9 months ago
2005
Springer
We describe a novel method for using Genetic Programming to create compact classification rules based on combinations of N-Grams (character strings). Genetic programs acquire fitne...
126
click to vote
ICFP
2008
ACM
16 years 3 months ago
2008
ACM
In the context of program verification in an interactive theorem prover, we study the problem of transforming function definitions with ML-style (possibly overlapping) pattern mat...
129
Voted
ESOP
1999
Springer
15 years 7 months ago
1999
Springer
Control Flow Analysis is a widely used approach for analysing functional and object oriented programs. Once the applications become more demanding also the analysis needs to be mor...
132
Voted
SAGT
2010
Springer
15 years 1 months ago
2010
Springer
The solution to a Nash or a nonsymmetric bargaining game is obtained by maximizing a concave function over a convex set, i.e., it is the solution to a convex program. We show that...