430 search results - page 12 / 86 » On Using Satisfiability-Based Pruning Techniques in Covering... |
180
Voted
APPROX
2000
Springer
15 years 7 months ago
2000
Springer
Given a graph (directed or undirected) with costs on the edges, and an integer k, we consider the problem of nding a k-node connected spanning subgraph of minimum cost. For the ge...
129
click to vote
CDES
2006
15 years 4 months ago
2006
- Most of the direct-cover Boolean minimization techniques use a four step cyclic algorithm. First, the algorithm chooses an On-minterm; second, it generates the set of prime impli...
122
Voted
IWOCA
2009
Springer
15 years 10 months ago
2009
Springer
The construction of covering arrays with the fewest rows remains a challenging problem. Most computational and recursive constructions result in extensive repetition of coverage. W...
109
click to vote
APLAS
2009
ACM
15 years 10 months ago
2009
ACM
We present a simple algorithmic extension of the classical call-strings approach to mitigate substantial performance degradation caused by spurious interprocedural cycles. Spuriou...
119
click to vote
IJACTAICIT
2010
15 years 20 days ago
2010
The aim of this work is to design an algorithm which combines between steganography and cryptography that can hide a text in an image in a way that prevents, as much as possible, ...