Sciweavers

3991 search results - page 733 / 799
» Bounding homogeneous models
Sort
View
STOC
1993
ACM
134views Algorithms» more  STOC 1993»
13 years 12 months ago
Quantum complexity theory
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...
Ethan Bernstein, Umesh V. Vazirani
AB
2007
Springer
13 years 12 months ago
Efficient Haplotype Inference with Pseudo-boolean Optimization
Abstract. Haplotype inference from genotype data is a key computational problem in bioinformatics, since retrieving directly haplotype information from DNA samples is not feasible ...
Ana Graça, João Marques-Silva, In&ec...
DSN
2009
IEEE
13 years 11 months ago
Efficient resource management on template-based web servers
The most commonly used request processing model in multithreaded web servers is thread-per-request, in which an individual thread is bound to serve each web request. However, with...
Eli Courtwright, Chuan Yue, Haining Wang
FMICS
2006
Springer
13 years 11 months ago
SAT-Based Verification of LTL Formulas
Abstract. Bounded model checking (BMC) based on satisfiability testing (SAT) has been introduced as a complementary technique to BDDbased symbolic model checking of LTL properties ...
Wenhui Zhang
APLAS
2008
ACM
13 years 10 months ago
Abstraction of Clocks in Synchronous Data-Flow Systems
ion of Clocks in Synchronous Data-flow Systems Albert Cohen1 , Louis Mandel2 , Florence Plateau2 , and Marc Pouzet23 1 INRIA Saclay - Ile-de-France, Orsay, France 2 LRI, Univ. Pari...
Albert Cohen, Louis Mandel, Florence Plateau, Marc...