Sciweavers

1346 search results - page 1 / 270
» On the number of rectangular partitions
Sort
View
SODA
2004
ACM
93views Algorithms» more  SODA 2004»
13 years 6 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
DM
2010
83views more  DM 2010»
13 years 4 months ago
Polychromatic colorings of arbitrary rectangular partitions
A general (rectangular) partition is a partition of a rectangle into an arbitrary number of non-overlapping subrectangles. This paper examines vertex colorings using four colors o...
Dániel Gerbner, Balázs Keszegh, Nath...
CIS
2005
Springer
13 years 10 months ago
Moving Block Sequence and Organizational Evolutionary Algorithm for General Floorplanning
⎯A new nonslicing floorplan representation, the moving block sequence (MBS), is proposed in this paper. Our idea of the MBS originates from the observation that placing blocks on...
Jing Liu, Weicai Zhong, Licheng Jiao
TPDS
2002
136views more  TPDS 2002»
13 years 4 months ago
Automatic Partitioning of Parallel Loops with Parallelepiped-Shaped Tiles
In this paper, an efficient algorithm to implement loop partitioning is introduced and evaluated. We start from results of Agarwal et al. [1] whose aim is to minimize the number of...
Fabrice Rastello, Yves Robert
CORR
2011
Springer
149views Education» more  CORR 2011»
12 years 12 months ago
Load-Balancing Spatially Located Computations using Rectangular Partitions
Distributing spatially located heterogeneous workloads is an important problem in parallel scientific computing. We investigate the problem of partitioning such workloads (repres...
Erik Saule, Erdeniz Ö. Bas, Ümit V. &Cce...