125 search results - page 17 / 25 » N Semantic Classes are Harder than Two |
IANDC
2011
14 years 4 months ago
2011
Partial transition systems support abstract model checking of complex temporal propercombining both over- and under-approximatingabstractions into a single model. Over the years, ...
ICC
2007
IEEE
15 years 4 months ago
2007
IEEE
Abstract - We propose a new space-time code (STC) structure that can achieve generalized optimal diversity (GOD) with a reduced design complexity, and also provide an increased cod...
54
Voted
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We calculate median adiabatic times (in seconds) of a specific superconducting adiabatic quantum processor for an NP-hard Ising spin glass instance class with up to N = 128 binary ...
91
Voted
PODC
2010
ACM
15 years 1 months ago
2010
ACM
Concurrent collection classes are widely used in multi-threaded programming, but they provide atomicity only for a fixed set of operations. Software transactional memory (STM) pr...
82
Voted
LREC
2010
14 years 11 months ago
2010
We provide a robust and detailed annotation scheme for information status, which is easy to use, follows a semantic rather than cognitive motivation, and achieves reasonable inter...