1795 search results - page 230 / 359 » On the Complexity of Circuit Satisfiability |
131
click to vote
GLOBECOM
2007
IEEE
16 years 25 days ago
2007
IEEE
—In most of the existing space–time code designs, achieving full diversity is based on maximum-likelihood (ML) decoding at the receiver that is usually computationally expensiv...
162
click to vote
ICPP
2007
IEEE
16 years 24 days ago
2007
IEEE
Sequence alignment is a fundamental problem in the computational biology. Many alignment methods have been proposed in the literature, such as pair-wise sequence alignment (2SA), ...
188
click to vote
ITNG
2007
IEEE
16 years 21 days ago
2007
IEEE
In this paper, we present several enhanced network techniques which are appropriate for VLSI implementation and have reduced complexity, high throughput, and simple routing algori...
155
click to vote
FASE
2007
Springer
16 years 20 days ago
2007
Springer
The play-in/play-out approach suggests a new paradigm for system development using scenario-based requirements. It allows the user to develop a high level scenario-based model of t...
181
click to vote
WDAG
2007
Springer
16 years 18 days ago
2007
Springer
Abstract. We examine the problem of detecting nested temporal predicates given the execution trace of a distributed program. We present a technique that allows efficient detection ...