890 search results - page 42 / 178 » New Approaches to Compare Phylogenetic Search Heuristics |
129
click to vote
KI
2007
Springer
15 years 8 months ago
2007
Springer
We introduce a novel stochastic local search algorithm for the vertex cover problem. Compared to current exhaustive search techniques, our algorithm achieves excellent performance ...
111
click to vote
CNSR
2007
IEEE
15 years 8 months ago
2007
IEEE
In this paper, conceptual frequency rate, a new frequency definition suitable for query stream mining, is introduced. An online single-pass algorithm called OFSD (Online Frequent...
108
click to vote
EVOW
2007
Springer
15 years 8 months ago
2007
Springer
Many instances of NP-hard problems can be solved efficiently if the treewidth of their corresponding graph is small. Finding the optimal tree decompositions is an NP-hard problem a...
140
click to vote
SPDP
1991
IEEE
15 years 5 months ago
1991
IEEE
The parallel genetic algorithm (PGA) is a prototype of a new kind of a distributed algorithm. It is based on a parallel search by individuals all of which have the complete proble...
120
click to vote
EMNLP
2009
14 years 11 months ago
2009
Many approaches to unsupervised morphology acquisition incorporate the frequency of character sequences with respect to each other to identify word stems and affixes. This typical...