1795 search results - page 261 / 359 » On the Complexity of Circuit Satisfiability |
114
click to vote
FCCM
2004
IEEE
15 years 4 months ago
2004
IEEE
The development of turbo codes has allowed for nearShannon limit information transfer in modern communication systems. Although turbo decoding is viewed as superior to alternate d...
132
Voted
DSD
2006
IEEE
15 years 4 months ago
2006
IEEE
Until now, most cryptography implementations on parallel architectures have focused on adapting the software to SIMD architectures initially meant for media applications. In this ...
115
click to vote
KR
2000
Springer
15 years 4 months ago
2000
Springer
In contrast with classical reasoning, where a solution is either correct or incorrect, approximate reasoning tries to compute solutions which are close to the ideal solution, with...
90
Voted
AAAI
2008
15 years 3 months ago
2008
Most algorithms for computing diagnoses within a modelbased diagnosis framework are deterministic. Such algorithms guarantee soundness and completeness, but are P 2 hard. To overc...
104
click to vote
GLVLSI
2010
IEEE
15 years 2 months ago
2010
IEEE
This paper describes a physics-based semi-analytical model for Schottky-barrier carbon nanotube (CNT) and graphene nanoribbon (GNR) transistors. The model includes the treatment o...