1456 search results - page 183 / 292 » A search quality evaluation based on objective-subjective me... |
147
click to vote
TCBB
2008
15 years 6 months ago
2008
Abstract-- The Maximum Parsimony problem aims at reconstructing a phylogenetic tree from DNA sequences while minimizing the number of genetic transformations. To solve this NP-comp...
179
click to vote
ICPR
2002
IEEE
16 years 7 months ago
2002
IEEE
: One way to scale up clustering algorithms is to squash the data by some intelligent compression technique and cluster only the compressed data records. Such compressed data recor...
163
click to vote
GECCO
2005
Springer
15 years 12 months ago
2005
Springer
GP uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees, and GP searches t...
200
click to vote
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
The non-English Web is growing at breakneck speed, but available language processing tools are mostly English based. Taxonomies are a case in point: while there are plenty of comm...
177
click to vote
TASE
2010
IEEE
15 years 1 months ago
2010
IEEE
Group elevator scheduling has received considerable attention due to its importance to transportation efficiency for mid-rise and high-rise buildings. One important trend to improv...