890 search results - page 19 / 178 » New Approaches to Compare Phylogenetic Search Heuristics |
127
click to vote
SAT
2009
Springer
15 years 8 months ago
2009
Springer
We propose a new incomplete algorithm for the Maximum Satisfiability (MaxSAT) problem on unweighted Boolean formulas, focused specifically on instances for which proving unsatis...
129
click to vote
DEXA
1995
Springer
15 years 5 months ago
1995
Springer
Abstract. The object-oriented database management systems store references to objects (implicit joins, precomputed joins), and use path expressions in query languages. One way of e...
EOR
2006
15 years 1 months ago
2006
In this work, we provide two heuristic algorithms for the matrix bandwidth reduction problem. The first is a genetic algorithm and the second uses node label adjustments. Experime...
106
click to vote
MTV
2003
IEEE
15 years 7 months ago
2003
IEEE
In recent years backtrack search SAT solvers have been the subject of dramatic improvements. These improvements allowed SAT solvers to successfully replace BDDs in many areas of f...
128
click to vote
RECOMB
2007
Springer
16 years 2 months ago
2007
Springer
In the past decade, genome rearrangements have attracted increasing attention from both biologists and computer scientists as a new type of data for phylogenetic analysis. Methods ...