3320 search results - page 103 / 664 » Heuristics for the Phylogeny Problem |
141
Voted
COMPSAC
2006
IEEE
16 years 6 days ago
2006
IEEE
Combinatorial covering arrays have been used in several testing approaches. This paper first discusses some existing methods for finding such arrays. Then a SAT-based approach a...
152
click to vote
CIBCB
2005
IEEE
15 years 11 months ago
2005
IEEE
— Hannenhalli and Pevzner developed the first polynomial-time algorithm for the combinatorial problem of sorting of signed genomic data. Their algorithm solves the minimum numbe...
135
click to vote
CAISE
2005
Springer
15 years 11 months ago
2005
Springer
A challenging question is how XML can be used to support distributed databases. This leads to the problem of how to obtain a suitable, cost-efficient distribution design for XML do...
180
Voted
STACS
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. In recent years, probabilistic analyses of algorithms have received increasing attention. Despite results on the average-case complexity and smoothed complexity of exact ...
125
Voted
SAT
2004
Springer
15 years 11 months ago
2004
Springer
The variable branching heuristics used in the most recent and most effective SAT solvers, including zChaff and BerkMin, can be viewed as consisting of a simple mechanism for rewa...