4095 search results - page 243 / 819 » How to test a tree |
166
click to vote
GECCO
2004
Springer
15 years 11 months ago
2004
Springer
In this paper we examine the effects of single node mutations on trees evolved via genetic programming. The results show that neutral mutations are less likely for nodes nearer th...
137
Voted
ACL
1998
15 years 7 months ago
1998
This paper describes how to construct a finite-state machine (FSM) approximating a 'unification-based' grammar using a left-corner grammar transform. The approximation i...
155
Voted
JCT
2008
15 years 5 months ago
2008
Let M denote the Laplacian matrix of a graph G. Associated with G is a finite group (G), obtained from the Smith normal form of M, and whose order is the number of spanning trees o...
116
Voted
CORR
2002
Springer
15 years 5 months ago
2002
Springer
Treebank formats and associated software tools are proliferating rapidly, with little consideration for interoperability. We survey a wide variety of treebank structures and opera...
165
click to vote
CAV
1999
Springer
15 years 10 months ago
1999
Springer
Abstract. In this paper we extend one of the main tools used in veri cation of discrete systems, namely Binary Decision Diagrams (BDD), to treat probabilistic transition systems. W...