19866 search results - page 45 / 3974 » Computing all factorizations in *** |
BIRTHDAY
2009
Springer
15 years 6 months ago
2009
Springer
We present a new hybrid BDD and SAT-based algorithm for model checking. Our algorithm is based on backward search, where each pre-image computation consists of an efficient All-SA...
CHI
2009
ACM
16 years 13 days ago
2009
ACM
The field of HCI has played an important role in broadening the spectrum of users of computational artifacts. However, users with extreme preferences are mostly ignored by the des...
STACS
2007
Springer
15 years 6 months ago
2007
Springer
We contribute to the study of efficient enumeration algorithms for all solutions of constraint satisfaction problems. The only algorithm known so far, presented by Creignou and H´...
CP
2005
Springer
15 years 5 months ago
2005
Springer
We propose a surprisingly simple new way of breaking all value symmetries with constraints. Our method requires the addition of one variable per value of the problem plus a linear ...
107
click to vote
RECOMB
2009
Springer
15 years 6 months ago
2009
Springer
In genome rearrangements, the double cut and join (DCJ) operation, introduced by Yancopoulos et al., allows to represent most rearrangement events that could happen in multichromos...