1068 search results - page 19 / 214 » For completeness, sublogarithmic space is no space |
ISCA
1993
IEEE
14 years 22 days ago
1993
IEEE
Virtual memoy page translation tables provide mappings from virtual to physical addresses. When the hardware controlled Tratmlation L.ookaside Buffers (TLBs) do not contain a tran...
AMAST
1991
Springer
14 years 4 days ago
1991
Springer
Boolean logic treats disjunction and conjunction symmetrically and algebraically. The corresponding operations for computation are respectively nondeterminism (choice) and concurr...
GLVLSI
2009
IEEE
14 years 3 months ago
2009
IEEE
The sequential depth determines the completeness of bounded model checking in design verification. Recently, a SATbased method is proposed to compute the sequential depth of a de...
DATE
2010
IEEE
14 years 1 months ago
2010
IEEE
— In this paper we present a cross-domain application for ambient and health monitoring. The system architecture is intended to be openly extensible in order to fulfil unanticipa...
ACS
2007
13 years 8 months ago
2007
Abstract. For a symmetric monoidal-closed category X and any object K, the category of K-Chu spaces is small-topological over X and small cotopological over Xop . Its full subcateg...