1346 search results - page 27 / 270 » On the number of rectangular partitions |
ECAL
2005
Springer
14 years 28 days ago
2005
Springer
We compare the long term behaviour of Conway’s Game of Life cellular automaton, from initial random configurations, on a bounded rectangular grid and a bounded Penrose tiling gr...
AMC
2004
13 years 7 months ago
2004
The present work investigates the efficiency of the multigrid numerical method when used to solve two-dimensional laminar velocity and temperature fields inside a rectangular doma...
WG
2004
Springer
14 years 22 days ago
2004
Springer
Abstract. Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are nonnegative integers. One wish to partition G into connected components...
ASPDAC
1999
ACM
13 years 11 months ago
1999
ACM
In this paper, two faster and better spectral algorithms are presented for the multi-way circuit partitioning problem with the objective of minimizing the Scaled Cost. As pointed ...
SIAMDM
2008
13 years 7 months ago
2008
The first-fit chromatic number of a graph is the number of colors needed in the worst case of a greedy coloring. It is also called the Grundy number, which is defined to be the max...