7259 search results - page 209 / 1452 » From Fields to Trees |
137
click to vote
GECCO
2004
Springer
15 years 11 months ago
2004
Springer
We are interested in schema disruption behavior when chromosomes are structured as binary trees. We give the definition of the disruption probability dp(H) of a schema H, and also...
202
click to vote
MFCS
2001
Springer
15 years 10 months ago
2001
Springer
We show that it is not possible to approximate the minimum Steiner tree problem within 1 + 1 162 unless RP = NP. The currently best known lower bound is 1 + 1 400. The reduction i...
159
click to vote
SIGCSE
1996
ACM
15 years 10 months ago
1996
ACM
The Binary Search Tree serves as an important example when teaching data structures. We explore new approaches to understanding the implementation of a Binary Search Tree, using c...
151
click to vote
AAAI
1990
15 years 7 months ago
1990
In this paper, we address the issue of evaluating decision trees generated from training examples by a learning algorithm. We give a set of performance measures and show how some ...
137
click to vote
IPL
2007
15 years 6 months ago
2007
We study the Kolmogorov complexity of a Binary Insertion Tree, and present a succinct encoding scheme for Binary Insertion Trees produced from incompressible permutations. Based o...