3136 search results - page 480 / 628 » Genetic programming theory |
177
click to vote
CF
2005
ACM
15 years 8 months ago
2005
ACM
Result checking is the theory and practice of proving that the result of an execution of a program on an input is correct. Result checking has most often been envisioned in the fr...
169
click to vote
ICFP
2010
ACM
15 years 7 months ago
2010
ACM
Reasoning about program equivalence is one of the oldest problems in semantics. In recent years, useful techniques have been developed, based on bisimulations and logical relation...
164
click to vote
CADE
2001
Springer
16 years 6 months ago
2001
Springer
Proof assistants based on type theories, such as Coq and Lego, allow users to omit subterms on input that can be inferred automatically. While those mechanisms are well known, ad-h...
159
click to vote
CORR
2002
Springer
15 years 6 months ago
2002
Springer
The first morphological learner based upon the theory of Whole Word Morphology (Ford et al., 1997) is outlined, and preliminary evaluation results are presented. The program, Whol...
179
click to vote
KDD
2009
ACM
16 years 7 months ago
2009
ACM
Conditional random fields(CRFs) are a class of undirected graphical models which have been widely used for classifying and labeling sequence data. The training of CRFs is typicall...