20 search results - page 1 / 4 » Branching Rules for Satisfiability Analysed with Factor Anal... |
AUSAI
2007
Springer
13 years 9 months ago
2007
Springer
Factor analysis is a statistical technique for reducing the number of factors responsible for a matrix of correlations to a smaller number of factors that may reflect underlying va...
AI
2005
Springer
13 years 5 months ago
2005
Springer
Maximum Boolean satisfiability (max-SAT) is the optimization counterpart of Boolean satisfiability (SAT), in which a variable assignment is sought to satisfy the maximum number of...
RTCSA
2000
IEEE
13 years 9 months ago
2000
IEEE
As a starting point for static program analysis a control flow graph (CFG) is needed. If only the binary executable is available, this CFG has to be reconstructed from sequences ...
CDC
2009
IEEE
13 years 2 months ago
2009
IEEE
This paper proposes a method for stroke segmentation to decompose Chinese characters to become individual strokes. The method first obtains the medial axes of any given Chinese cha...
CORR
2011
Springer
13 years 1 days ago
2011
Springer
— We consider the decentralized binary hypothesis testing problem on trees of bounded degree and increasing depth. For a regular tree of depth t and branching factor k ≥ 2, we ...