66 search results - page 4 / 14 » Rewriting Haskell Strings |
122
click to vote
JSC
2007
15 years 9 days ago
2007
Given a monoid string rewriting system M, one way of obtaining a complete rewriting system for M is to use the classical Knuth-Bendix critical pairs completion algorithm. It is we...
125
Voted
GECCO
2004
Springer
15 years 5 months ago
2004
Springer
Chemical Genetic Programming (CGP) is a new method of genetic programming that introduced collision-based biochemical processes and realized dynamic mapping from genotypic strings ...
FUIN
2006
15 years 13 days ago
2006
In most models of computation, a device performs some type of process, and only some final output is regarded as the result. In adding an observer to such a device, one can obtain ...
91
Voted
AIPS
2008
15 years 2 months ago
2008
This document formalizes and discusses the implementation of a new, more efficient probabilistic plan recognition algorithm called Yet Another Probabilistic Plan Recognizer, (Yapp...
74
Voted
ECAL
2001
Springer
15 years 5 months ago
2001
Springer
