Sciweavers

4095 search results - page 243 / 819
» How to test a tree
Sort
View
108
Voted
GECCO
2004
Springer
114views Optimization» more  GECCO 2004»
15 years 6 months ago
A Study of the Role of Single Node Mutation in Genetic Programming
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...
Wei Quan, Terence Soule
79
Voted
ACL
1998
15 years 1 months ago
Finite-state Approximation of Constraint-based Grammars using Left-corner Grammar Transforms
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...
Mark Johnson
104
Voted
JCT
2008
85views more  JCT 2008»
15 years 17 days ago
Smith normal form and Laplacians
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...
Dino J. Lorenzini
74
Voted
CORR
2002
Springer
95views Education» more  CORR 2002»
15 years 12 days ago
An Integrated Framework for Treebanks and Multilayer Annotations
Treebank formats and associated software tools are proliferating rapidly, with little consideration for interoperability. We survey a wide variety of treebank structures and opera...
Scott Cotton, Steven Bird
106
Voted
CAV
1999
Springer
104views Hardware» more  CAV 1999»
15 years 4 months ago
On the Representation of Probabilities over Structured Domains
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...
Marius Bozga, Oded Maler