1064 search results - page 152 / 213 » Single Tree Grammars |
141
Voted
ESA
2008
Springer
15 years 5 months ago
2008
Springer
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...
112
Voted
IJCAI
1997
15 years 4 months ago
1997
In tree search, depth-first search (DFS) often uses ordering successor heuristics. If the heuristic makes a mistake ordering a bad successor (without goals in its subtree) before ...
115
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
Phylogenetic networks are a generalization of phylogenetic trees that allow for the representation of non-treelike evolutionary events, like recombination, hybridization, or later...
131
click to vote
JMLR
2008
15 years 3 months ago
2008
Feature ranking is a fundamental machine learning task with various applications, including feature selection and decision tree learning. We describe and analyze a new feature ran...
137
click to vote
NECO
2006
15 years 3 months ago
2006
The application of boosting technique to the regression problems has received relatively little attention in contrast to the research aimed at classification problems. This paper ...