Sciweavers

350 search results - page 47 / 70
» Branching Programs for Tree Evaluation
Sort
View
PLILP
1992
Springer
13 years 11 months ago
Strictness Analysis for Attribute Grammars
Attribute grammars may be seen as a (rather specialised) lazy or demand-driven programming language. The "programs" in this language take text or parse trees as input an...
Mads Rosendahl
CORR
2006
Springer
153views Education» more  CORR 2006»
13 years 7 months ago
Genetic Programming, Validation Sets, and Parsimony Pressure
Fitness functions based on test cases are very common in Genetic Programming (GP). This process can be assimilated to a learning task, with the inference of models from a limited n...
Christian Gagné, Marc Schoenauer, Marc Pari...
CG
2006
Springer
13 years 9 months ago
Feature Construction for Reinforcement Learning in Hearts
Temporal difference (TD) learning has been used to learn strong evaluation functions in a variety of two-player games. TD-gammon illustrated how the combination of game tree search...
Nathan R. Sturtevant, Adam M. White
ACL
2010
13 years 5 months ago
Automatic Generation of Story Highlights
In this paper we present a joint content selection and compression model for single-document summarization. The model operates over a phrase-based representation of the source doc...
Kristian Woodsend, Mirella Lapata
FLAIRS
2006
13 years 9 months ago
Using Enhanced Concept Map for Student Modeling in Programming Tutors
We have been using the concept map of the domain, enhanced with pedagogical concepts called learning objectives, as the overlay student model in our intelligent tutors for program...
Amruth N. Kumar