Sciweavers

1977 search results - page 57 / 396
» The satisfactory partition problem
Sort
View
EGH
2004
Springer
15 years 11 months ago
Mio: fast multipass partitioning via priority-based instruction scheduling
Real-time graphics hardware continues to offer improved resources for programmable vertex and fragment shaders. However, shader programmers continue to write shaders that require ...
Andrew Riffel, Aaron E. Lefohn, Kiril Vidimce, Mar...
ICES
2003
Springer
124views Hardware» more  ICES 2003»
15 years 11 months ago
Evolving Multiplier Circuits by Training Set and Training Vector Partitioning
Evolvable Hardware (EHW) has been proposed as a new method for evolving circuits automatically. One of the problems appearing is that only circuits of limited size are evolvable. I...
Jim Torresen
FPGA
1995
ACM
107views FPGA» more  FPGA 1995»
15 years 9 months ago
Multi-way System Partitioning into a Single Type or Multiple Types of FPGAs
This paper considers the problem of partitioning a circuit into a collection of subcircuits, such that each subcircuit is feasible for some device from an FPGA library, and the to...
Dennis J.-H. Huang, Andrew B. Kahng
DM
2000
73views more  DM 2000»
15 years 5 months ago
Some formulae for partitions into squares
We consider the new problem of determining the number of partitions of a number into a fixed number k of squares, and find explicit formulae in the cases k = 2, 3, 4. Classificati...
Michael D. Hirschhorn
CCCG
2006
15 years 7 months ago
Geometric Separator for d-Dimensional Ball Graphs
We study the graph partitioning problem on ddimensional ball graphs in a geometric way. Let B be a set of balls in d-dimensional Euclidean space with radius ratio and -precision....
Kebin Wang, Shang-Hua Teng