Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 27 for “"Partitions (Mathematics)"”.
-
Partitions into large unequal parts / Kevin John Fergusson.
Bibliography: p. 145-146.
-
Algorithms for signal decoding using graph partitioning
Thesis (M.S.)--Michigan State University. Department of Electrical Engineering, 1991
-
Cardinal numbers with partition properties
This discussion divides into two quite separate parts, chapters I - IV and chapter V. The first four chapters are concerned with a generalization of the partition properties k — (nl)n and k — (n)v<w extensively studied by Erdos and his collaborators (see [5] and [6] for further references).
-
PARTITIONING STRONGLY REGULAR GRAPHS (BALANCED INCOMPLETE BLOCK DESIGNS, ASSOCIATION SCHEMES).
A strongly regular graph can be design partitioned if the vertices of the graph can be partitioned into two sets V and B such that V is a coclique and every vertex in B is adjacent to the same number of vertices in V. In this case, a balanced incomplete block design can be defined by taking …
-
A group theoretic approach to metaheuristic local search for partitioning problems
Recent work has demonstrated the power of combining group theory with metaheuristic search methodologies to solve discrete optimization problems. Group theory provides tools to characterize the underlying structures in move neighborhoods, solution representations and solution landscapes. Exploiting …
-
Patterns in set partitions and restricted growth functions
… notions of pattern avoidance.One is in set partitions $\sigma$ of $[n]=\{1,2\dots, n\}$ which are families of nonempty subsets $B_1,\dots,B_k$ whose disjoint union is $[n]$, written $\sigma=B_1/\dots/B_k\vdash S$. The other is in restricted growth functions (RGFs) which are words …
-
A New Approach to Machine Learning Hardware Classifier Design Based on Functional Decomposition of Multi-Valued Functions
This dissertation presents a novel design of a hardware classifier based on combining modified Ashenhurst-Curtis Decomposition and multiplexer-based synthesis. The PSUD classifier brings three new contributions: an approach to solve the column multiplicity problem, an approach to encode …
-
Pattern avoidance in set partitions and compositions
… D.)--Michigan State University. Department of Mathematics, 2007
-
Multilevel circuit partitioning for computer-aided VLSI design
As designs become massively interconnect-dominated and present unmanageable instance complexities, circuit partitioning is recognized as a critical optimization problem in computer-aided VLSI design automation; the feasibility as well as the quality of the automatic placement and routing procedures …
-
Partition Properties for Non-Ordinal Sets under the Axiom of Determinacy
In this paper we explore coloring theorems for the reals, its quotients, cardinals, and their combinations. This work is done under the scope of the axiom of determinacy. We also explore generalizations of Mycielski's theorem and show how these can be used to establish coloring theorems. To finish, …
Page 1 of 2