4743 search results - page 291 / 949 » The PlusCal Algorithm Language |
118
click to vote
CLEF
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. In this paper, we present an unsupervised algorithm for morpheme discovery called UNGRADE (UNsupervised GRAph DEcomposition). UNGRADE works in three steps and can be appl...
115
click to vote
GECCO
2008
Springer
15 years 4 months ago
2008
Springer
We investigated how indexed FOR-loops, such as the ones found in procedural programming languages, can be implemented in genetic programming. We use them to train programs that le...
125
click to vote
ICALP
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Given an ML function f : (int->int)->int how can we rigorously specify that f is pure, i.e., produces no side-effects other than those arising from calling its func...
135
click to vote
ENTCS
2006
15 years 3 months ago
2006
The project Safe Pointers by Graph Transformation at the University of York has developed a method for specifying the shape of pointer-data structures by graph reduction, and a st...
ENTCS
2006
15 years 3 months ago
2006
This paper presents a three-step approach for interoperabilising heterogeneous semantic resources. Firstly, we construct homogeneous representations of these resources in a pivot ...