279 search results - page 26 / 56 » Tree Pattern Rewriting Systems |
143
click to vote
SRDS
1998
IEEE
15 years 9 months ago
1998
IEEE
We study parallel algorithms for computing the minimum spanning tree of a weighted undirected graph G with n vertices and m edges. We consider an input graph G with m=n p, where p...
136
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
We introduce a clustering-based method of subpopulation management in genetic programming (GP) called Evolutionary Tree Genetic Programming (ETGP). The biological motivation behin...
261
click to vote
POPL
2009
ACM
16 years 5 months ago
2009
ACM
In this paper, we show how pattern matching can be seen to arise from a proof term assignment for the focused sequent calculus. This use of the Curry-Howard correspondence allows ...
146
click to vote
ICFP
2000
ACM
15 years 9 months ago
2000
ACM
We review the close relationship between abstract machines for (call-by-name or call-by-value) λ-calculi (extended with Felleisen’s C) and sequent calculus, reintroducing on the...
248
click to vote
SYRCODIS
2008
15 years 6 months ago
2008
In the last few years, XML became a de-facto standard for the exchange of structured and semi-structured data. The database research community took this development into account b...