10 search results - page 1 / 2 » Reversible DAC and Other Improvements for Solving Max-CSP |
AAAI
1998
13 years 6 months ago
1998
CP
2003
Springer
13 years 10 months ago
2003
Springer
For the last ten years, a significant amount of work in the constraint community has been devoted to the improvement of complete methods for solving soft constraints networks. We ...
RECOMB
2007
Springer
14 years 5 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 ...
DAC
2002
ACM
14 years 5 months ago
2002
ACM
Research in algorithms for Boolean satisfiability and their efficient implementations [26, 8] has recently outpaced benchmarking efforts. Most of the classic DIMACS benchmarks fro...
CPM
2004
Springer
13 years 8 months ago
2004
Springer
The problem of sorting a signed permutation by reversals is inspired by genome rearrangements in computational molecular biology. Given two genomes represented as two signed permut...