4743 search results - page 270 / 949 » Introduction to Functional Programming |
168
click to vote
ANOR
2005
15 years 6 months ago
2005
We review strong inequalities for fundamental knapsack relaxations of (mixed) integer programs. These relaxations are the 0-1 knapsack set, the mixed 0-1 knapsack set, the integer ...
196
click to vote
JCP
2007
15 years 6 months ago
2007
Abstract— We describe a general method to transform a non-Markovian sequential decision problem into a supervised learning problem using a K-bestpaths algorithm. We consider an a...
161
click to vote
CG
2004
Springer
15 years 6 months ago
2004
Springer
We provide a formal proof of equivalence between the class of fractals created by Recursive Turtle Programs (RTP) and Iterated Affine Transformations (IAT). We begin by reviewing ...
168
click to vote
CG
2000
Springer
15 years 6 months ago
2000
Springer
The Back of an Envelope project demonstrates how a calligraphic interface (one that employs a pen or stylus to input freehand drawing marks) can be used in a wide variety of domai...
157
click to vote
TEC
1998
15 years 6 months ago
1998
Abstract— Traditional investigations with evolutionary programming (EP) for continuous parameter optimization problems have used a single mutation operator with a parameterized p...