1376 search results - page 71 / 276 » Searching Trees: An Essay |
103
click to vote
CEC
2010
IEEE
15 years 1 months ago
2010
IEEE
Inspired originally by the Learnable Evolution Model(LEM) [5], we investigate LEM(ID3), a hybrid of evolutionary search with ID3 decision tree learning. LEM(ID3) involves interleav...
CSB
2003
IEEE
15 years 5 months ago
2003
IEEE
We describe a method for finding ungapped conserved words in rRNA sequences that is effective, utilizes evolutionary information and does not depend on multiple sequence alignment...
COMGEO
2004
ACM
14 years 11 months ago
2004
ACM
We consider point location in Delaunay triangulations with the aid of simple data structures. In particular, we analyze methods in which a simple data structure is used to first lo...
120
click to vote
ICDM
2006
IEEE
15 years 6 months ago
2006
IEEE
We propose an algorithm for extracting fields from HTML search results. The output of the algorithm is a database table– a data structure that better lends itself to high-level...
127
click to vote
GECCO
2009
Springer
15 years 6 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...