16404 search results - page 2687 / 3281 » A set coverage problem |
195
click to vote
FGR
2004
IEEE
15 years 11 months ago
2004
IEEE
The null space-based LDA takes full advantage of the null space while the other methods remove the null space. It proves to be optimal in performance. From the theoretical analysi...
169
click to vote
CP
2006
Springer
15 years 11 months ago
2006
Springer
A wide range of counting and occurrence constraints can be specified with just two global primitives: the Range constraint, which computes the range of values used by a sequence of...
204
click to vote
FPGA
2004
ACM
15 years 11 months ago
2004
ACM
This paper presents a new approach to timing optimization for FPGA designs, namely incremental physical resynthesis, to answer the challenge of effectively integrating logic and p...
197
click to vote
CP
2006
Springer
15 years 11 months ago
2006
Springer
Dynamic Backtracking (DBT) is a well known algorithm for solving Constraint Satisfaction Problems. In DBT, variables are allowed to keep their assignment during backjump, if they a...
222
click to vote
GCB
2004
Springer
15 years 11 months ago
2004
Springer
: In biological sequence analysis, position specific scoring matrices (PSSMs) are widely used to represent sequence motifs. In this paper, we present a new nonheuristic algorithm, ...