2255 search results - page 257 / 451 » Computing a Center-Transversal Line |
189
click to vote
APPROX
2007
Springer
16 years 24 days ago
2007
Springer
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
189
click to vote
ASPDAC
2006
ACM
16 years 17 days ago
2006
ACM
- One of the critical issues in MTCMOS design is how to estimate a circuit delay quickly. In this paper, we propose a delay modeling and static timing analysis (STA) methodology ta...
201
click to vote
KBSE
2005
IEEE
16 years 5 days ago
2005
IEEE
In test generation based on model-checking, white-box test criteria are represented as trap conditions written in a temporal logic. A model checker is used to refute trap conditio...
153
click to vote
ASPLOS
2004
ACM
16 years 1 days ago
2004
ACM
This paper explores a new technique called coherence decoupling, which breaks a traditional cache coherence protocol into two protocols: a Speculative Cache Lookup (SCL) protocol ...
173
click to vote
IEEEPACT
2003
IEEE
15 years 12 months ago
2003
IEEE
This paper presents a framework for analyzing the performance of multithreaded programs using a model called a constraint graph. We review previous constraint graph definitions fo...