Sciweavers

16504 search results - page 315 / 3301
» New Problems, New Solutions
Sort
View
DATE
2006
IEEE
102views Hardware» more  DATE 2006»
16 years 23 days ago
Faster exploration of high level design alternatives using UML for better partitions
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...
Waseem Ahmed, Doug Myers
IJCAI
2007
15 years 8 months ago
From Sampling to Model Counting
We introduce a new technique for counting models of Boolean satisfiability problems. Our approach incorporates information obtained from sampling the solution space. Unlike previ...
Carla P. Gomes, Jörg Hoffmann, Ashish Sabharw...
JFPLC
2003
15 years 8 months ago
Une approche hybride pour l'optimisation multi-objectif sous contraintes
ABSTRACT. We present PICPA, a new algorithm for tackling constrained continuous multiobjective problems. The algorithm combines constraint propagation techniques and evolutionary c...
Vincent Barichard, Jin-Kao Hao
JMLR
2012
13 years 9 months ago
Primal-Dual methods for sparse constrained matrix completion
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...
Yu Xin, Tommi Jaakkola
154
Voted
COMBINATORICS
2002
86views more  COMBINATORICS 2002»
15 years 6 months ago
On the Dimer Problem and the Ising Problem in Finite 3-dimensional Lattices
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...
Martin Loebl