Sciweavers

342 search results - page 16 / 69
» Constrained Integer Partitions
Sort
View
ALGORITHMICA
2007
145views more  ALGORITHMICA 2007»
13 years 8 months ago
Counting Integer Points in Parametric Polytopes Using Barvinok's Rational Functions
Abstract Many compiler optimization techniques depend on the ability to calculate the number of elements that satisfy certain conditions. If these conditions can be represented by ...
Sven Verdoolaege, Rachid Seghir, Kristof Beyls, Vi...
ITC
1999
IEEE
107views Hardware» more  ITC 1999»
14 years 23 days ago
A high-level BIST synthesis method based on a region-wise heuristic for an integer linear programming
A high-level built-in self-test (BIST) synthesis involves several tasks such as system register assignment, interconnection assignment, and BIST register assignment. Existing high...
Han Bin Kim, Dong Sam Ha
SODA
2004
ACM
93views Algorithms» more  SODA 2004»
13 years 9 months ago
On the number of rectangular partitions
How many ways can a rectangle be partitioned into smaller ones? We study two variants of this problem: when the partitions are constrained to lie on n given points (no two of whic...
Eyal Ackerman, Gill Barequet, Ron Y. Pinter
COMBINATORICS
2007
68views more  COMBINATORICS 2007»
13 years 8 months ago
Compositions of Graphs Revisited
The idea of graph compositions, which was introduced by A. Knopfmacher and M. E. Mays, generalizes both ordinary compositions of positive integers and partitions of finite sets. ...
Aminul Huq
TIT
2008
105views more  TIT 2008»
13 years 8 months ago
Network Coding Capacity With a Constrained Number of Coding Nodes
Abstract-- We study network coding capacity under a constraint on the total number of network nodes that can perform coding. That is, only a certain number of network nodes can pro...
Jillian Cannons, Kenneth Zeger