89 search results - page 8 / 18 » Upper Bounds on the Number of Solutions of Binary Integer Pr... |
GLVLSI
1996
IEEE
13 years 11 months ago
1996
IEEE
In this paper, we propose a global routing algorithm for multi-layer building-block layouts. The algorithm is based on successive ripup and rerouting while satisfying edge capacit...
ATMOS
2007
13 years 9 months ago
2007
In this paper we study a general formulation of the train platforming problem, which contains as special cases all the versions previously considered in the literature as well as a...
ICDE
2008
IEEE
14 years 8 months ago
2008
IEEE
Abstract-- A decomposition of a binary matrix into two matrices gives a set of basis vectors and their appropriate combination to form the original matrix. Such decomposition solut...
ALENEX
2009
13 years 8 months ago
2009
A tanglegram is a pair of trees whose leaf sets are in oneto-one correspondence; matching leaves are connected by inter-tree edges. In applications such as phylogenetics or hierar...
IJCAI
1989
13 years 8 months ago
1989
A constraint satisfaction problem, or CSP, can be reformulated as an integer linear programming problem. The reformulated problem can be solved via polynomial multiplication. If t...