51 search results - page 7 / 11 » Trichotomy in the Complexity of Minimal Inference |
PODS
2011
ACM
12 years 9 months ago
2011
ACM
Scientific workflow systems increasingly store provenance information about the module executions used to produce a data item, as well as the parameter settings and intermediate...
EUROGP
2009
Springer
14 years 1 months ago
2009
Springer
Code bloat, the excessive increase of code size, is an important issue in Genetic Programming (GP). This paper proposes a theoretical analysis of code bloat in GP from the perspec...
ISAAC
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. We investigate the computational complexity of a new combinatorial problem of inferring a smallest possible multi-labeled phylogenetic tree (MUL tree) which is consistent...
IAT
2007
IEEE
14 years 1 months ago
2007
IEEE
Here we revisit ADOPT-ing and bring two new contributions. One contribution consists of developing variations on the algorithms keeping the improvement in length of chain of causa...
PODS
2010
ACM
13 years 11 months ago
2010
ACM
A generalization from string to trees and from languages to translations is given of the classical result that any regular language can be learned from examples: it is shown that ...