215 search results - page 38 / 43 » Quantum computers that can be simulated classically in polyn... |
GLOBECOM
2008
IEEE
13 years 7 months ago
2008
IEEE
Hash functions have a space complexity of O(n) and a possible time complexity of O(1). Thus, packet classifiers exploit hashing to achieve packet classification in wire speed. Esp...
CMSB
2008
Springer
13 years 9 months ago
2008
Springer
We present the Piecewise Linear Approximation Model of Ion Channel contribution (PLAMIC) to cardiac excitation. We use the PLAMIC model to conduct formal analysis of cardiac arrhyt...
ICNP
2006
IEEE
14 years 1 months ago
2006
IEEE
— Internet routers today can be overwhelmed by a large number of BGP updates triggered by events such as session resets, link failures, and policy changes. Such excessive updates...
QEST
2007
IEEE
14 years 1 months ago
2007
IEEE
We investigate logics and equivalence relations that capture the qualitative behavior of Markov Decision Processes (MDPs). We present Qualitative Randomized Ctl (Qrctl): formulas o...
ITC
1998
IEEE
13 years 12 months ago
1998
IEEE
This paper addresses the problem of efficiently and accurately generating two-vector tests for crosstalk induced effects, such as pulses, signal speedup and slowdown, in digital c...