16430 search results - page 154 / 3286 » On Computable Tree Functions |
159
click to vote
WABI
2004
Springer
15 years 11 months ago
2004
Springer
Computational heuristics are the primary methods for reconstruction of phylogenetic trees on large datasets. Most large-scale phylogenetic analyses produce numerous trees that are ...
192
click to vote
FOCS
2008
IEEE
16 years 23 days ago
2008
IEEE
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...
157
click to vote
HOA
1993
15 years 10 months ago
1993
This paper studies termination properties of rewrite systems that are typeable using intersection types. It introduces a notion of partial type assignment on Curryfied Term Rewri...
182
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
This paper introduces a procedure based on genetic programming to evolve XSLT programs (usually called stylesheets or logicsheets). XSLT is a general purpose, document-oriented fu...
153
click to vote
COMPGEOM
1990
ACM
15 years 10 months ago
1990
ACM
Given a set of nonintersecting polygonal obstacles in the plane, the link distance between two points s and t is the minimum number of edges required to form a polygonal path conn...