236 search results - page 17 / 48 » Binary Partitions Revisited |
ICASSP
2008
IEEE
15 years 7 months ago
2008
IEEE
The maximization of a full-rank quadratic form over a finite alphabet is NP-hard in both a worst-case sense and an average sense. Interestingly, if the rank of the form is not a ...
115
Voted
IPCO
2008
15 years 2 months ago
2008
We consider the positive semidefinite (psd) matrices with binary entries. We give a characterisation of such matrices, along with a graphical representation. We then move on to co...
114
click to vote
ARSCOM
2005
15 years 17 days ago
2005
A subset U of a set S with a binary operation is called avoidable if S can be partitioned into two subsets A and B such that no element of U can be written as a product of two dis...
93
Voted
DAC
1998
ACM
16 years 1 months ago
1998
ACM
Efficient techniques for the manipulation of Binary Decision Diagrams (BDDs) are key to the success of formal verification tools. Recent advances in reachability analysis and mode...
129
click to vote
EC
2008
15 years 6 days ago
2008
We consider an optimization problem of finding the best possible offspring as a result of a recombination operator in an evolutionary algorithm, given two parent solutions. The op...