610 search results - page 85 / 122 » Using SAT in QBF |
AB
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Haplotype inference from genotype data is a key computational problem in bioinformatics, since retrieving directly haplotype information from DNA samples is not feasible ...
ASPLOS
2008
ACM
13 years 9 months ago
2008
ACM
Extracting high-performance from the emerging Chip Multiprocessors (CMPs) requires that the application be divided into multiple threads. Each thread executes on a separate core t...
DATE
2008
IEEE
14 years 2 months ago
2008
IEEE
We compare 12 new encodings for representing of FPGA detailed routing problems as equivalent Boolean Satisfiability (SAT) problems against the only 2 previously used encodings. We...
AI
2005
Springer
13 years 7 months ago
2005
Springer
We present a new series of distributed constraint satisfaction algorithms, the distributed breakout algorithms, which is inspired by local search algorithms for solving the constr...
INDOCRYPT
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. This paper presents the first results on AIDA/cube, algebraic and sidechannel attacks on variable number of rounds of all members of the KATAN family of block ciphers. Ou...