14548 search results - page 2706 / 2910 » The Optimal Path-Matching Problem |
141
click to vote
CSB
2004
IEEE
15 years 10 months ago
2004
IEEE
Phylogenetic trees are commonly reconstructed based on hard optimization problems such as maximum parsimony (MP) and maximum likelihood (ML). Conventional MP heuristics for produc...
159
click to vote
CAAN
2006
Springer
15 years 10 months ago
2006
Springer
We consider the problem of finding a short path between any two nodes of a network when no global information is available, nor any oracle to help in routing. A mobile agent, situa...
186
click to vote
ECML
2004
Springer
15 years 10 months ago
2004
Springer
It is well-known that naive Bayes performs surprisingly well in classification, but its probability estimation is poor. In many applications, however, a ranking based on class prob...
165
click to vote
EMSOFT
2004
Springer
15 years 10 months ago
2004
Springer
High-level programming languages offer significant expressivity but provide little or no guarantees about resource use. Resourcebounded languages -- such as hardware-description l...
176
click to vote
FGR
2004
IEEE
15 years 10 months ago
2004
IEEE
The null space-based LDA takes full advantage of the null space while the other methods remove the null space. It proves to be optimal in performance. From the theoretical analysi...