295 search results - page 4 / 59 » SAT, SMT and Applications |
HPCA
2012
IEEE
13 years 5 months ago
2012
IEEE
Multiprocessor architectures that continuously execute atomic blocks (or chunks) of instructions can improve performance and software productivity. However, all of the prior propo...
JAR
2007
14 years 9 months ago
2007
SAT-solvers have turned into essential tools in many areas of applied logic like, for example, hardware verification or satisfiability checking modulo theories (SMT). And althoug...
CADE
2011
Springer
13 years 9 months ago
2011
Springer
Abstract. Methods exploiting problem symmetries have been very successful in several areas including constraint programming and SAT solving. We here recast a technique to enhance t...
76
Voted
ACMSE
2006
ACM
15 years 3 months ago
2006
ACM
Although the satisfiability problem (SAT) is NP-complete, state-of-the-art solvers for SAT can solve instances that are considered to be very hard. Emerging applications demand t...
ICPADS
2002
IEEE
15 years 2 months ago
2002
IEEE
This paper presents the study and results of running several core multimedia applications on a simultaneous multithreading (SMT) architecture, including some detailed analysis ran...