Partitioning is a time consuming and computationally complex optimization problem in the codesign of hardware software systems. The stringent time-to-market requirements have resu...
We introduce a new technique for counting models of Boolean satisfiability problems. Our approach incorporates information obtained from sampling the solution space. Unlike previ...
ABSTRACT. We present PICPA, a new algorithm for tackling constrained continuous multiobjective problems. The algorithm combines constraint propagation techniques and evolutionary c...
We develop scalable algorithms for regular and non-negative matrix completion. In particular, we base the methods on trace-norm regularization that induces a low rank predicted ma...
We present a new expression for the partition function of the dimer arrangements and the Ising partition function of the 3-dimensional cubic lattice. We use the Pfaffian method. T...