61 search results - page 11 / 13 » On Resolution Proofs for Combinational Equivalence |
ENTCS
2007
13 years 6 months ago
2007
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether de...
SAT
2009
Springer
14 years 24 days ago
2009
Springer
Abstract. We present a new method to break symmetry in graph coloring problems. While most alternative techniques add symmetry breaking predicates in a pre-processing step, we deve...
BLISS
2009
IEEE
13 years 7 months ago
2009
IEEE
The exploitation of biometrics information in human shadow silhouettes (shadow biometrics), derived from video imagery after processing by gait analysis methods opens new avenues ...
RTSS
2007
IEEE
14 years 16 days ago
2007
IEEE
The increased complexity of performance-sensitive software systems leads to increased use of automated adaptation policies in lieu of manual performance tuning. Composition of ada...
ALT
2006
Springer
14 years 3 months ago
2006
Springer
This paper presents a novel paradigm for learning languages that consists of mapping strings to an appropriate high-dimensional feature space and learning a separating hyperplane i...