2477 search results - page 173 / 496 » Parallelizing Functional Programs by Generalization |
136
click to vote
ICML
2008
IEEE
16 years 7 months ago
2008
IEEE
In apprenticeship learning, the goal is to learn a policy in a Markov decision process that is at least as good as a policy demonstrated by an expert. The difficulty arises in tha...
160
Voted
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 ...
187
Voted
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...
145
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 ...
145
click to vote
EUROPAR
2005
Springer
15 years 11 months ago
2005
Springer
Within the EP-Cache project, the Performance Cockpit has been developed to provide a unified GUI for a series of performance tools. This is achieved through the establishment of a...