4137 search results - page 297 / 828 » On the number of matchings of a tree |
175
click to vote
PPPJ
2009
ACM
16 years 1 months ago
2009
ACM
Dynamic compilers can optimize application code specifically for observed code behavior. Such behavior does not have to be stable across the entire program execution to be bene...
173
Voted
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
The most popular approaches for reconstructing phylogenetic trees attempt to solve NP-hard optimization criteria such as maximum parsimony (MP). Currently, the bestperforming heur...
180
click to vote
SIAMCOMP
2000
15 years 6 months ago
2000
The bipartite crossing number problem is studied, and a connection between this problem and the linear arrangement problem is established. It is shown that when the arboricity is ...
186
click to vote
TSMC
2002
15 years 6 months ago
2002
Page-based Linear Genetic Programming (GP) is proposed in which individuals are described in terms of a number of pages. Pages are expressed in terms of a fixed number of instructi...
158
Voted
WWW
2007
ACM
16 years 7 months ago
2007
ACM
We describe an adaptive method for extracting records from web pages. Our algorithm combines a weighted tree matching metric with clustering for obtaining data extraction patterns...