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 22 for “"partition problem"”.
-
A Generalization of The Partition Problem in Statistics
In this dissertation, the problem of partitioning a set of treatments with respect to a control treatment is considered. Starting in 1950's a number of researchers have worked on this problem and have proposed alternative solutions. In Tong (1979), the authors proposed a formulation to solve this …
-
Construction of Some Unbalanced Designs for the Partition Problem
… formulated some methodologies in the case of the problem of selecting the best normal population. In statistical literature, many vector-at-a time and unbalanced methodologies are available for the selecting the best normal population. However, the literature is not that rich for the partition …
-
Applying deep convolutional neural networks to the dragon boat partition problem
We investigate approximating the Dragon Boat Partition problem, a practical real-worldvariant of the Partition problem. A team of dragon boat participants must be partitionedwith an approximately balanced arrangement with a preferable weight difference of 0. Wepresent two approaches that capture …
-
Statistical partition problem for exponential populations and statistical surveillance of cancers in Louisiana
In this dissertation, we consider the problem of partitioning a set of k population with respect to a control population. For this problem some multistage methodologies are proposed and their properties are derived. Using the Monte Carlo simulation techniques, the small and moderate sample size …
-
A Branch-and-Cut Algorithm based on Semidefinite Programming for the Minimum k-Partition Problem
The minimum k-partition (MkP) problem is a well-known optimization problem encountered in various applications most notably in telecommunication and physics. Formulated in the early 1990s by Chopra and Rao, the MkP problem is the problem of partitioning the set of vertices of a graph into k …
-
Determining partition elements with feedback constraints
The partition problem is that step in the layout problem in which it must be decided which of the elementary digital circuits are to be coalesced into a single, electronic package. A solution of the partition problem must satisfy constraints on the number of elementary circuits that can be put into …
-
Self-stabilizing group membership protocol
In this thesis, we consider the problem of partitioning a network into groups of bounded diameter. Given a network of processes X and a constant D, the group partition problem is the problem of finding a D-partition of X, that is, a partition of X into disjoint connected subgraphs, which we call …
-
Majority in the Three-Way Comparison Model
In this thesis, we study comparison based problems in a new comparison model called three-way, where a comparison can result in { >, =, < }. We consider a set of n balls with fixed ordered coloring. Particularly, we are interested in finding a ball of the majority color, the color that occurs more …
-
Comm-Bots - Distributed Coordination Of Mobile Robot Swarms To Support Message Communication
… been proposed as a means of preventing network partitions from occurring. However, it is impossible to prevent network partition in all cases, and so methods that adapt to network partition are of paramount importance. This dissertation proposes and compares different control strategies aimed at …
-
New Applications of Topological Methods in Discrete Geometry
… new applications of topological methods to problems in discrete geometry. The topological proof strategy we use goes back to Lovász' 1978 proof of the Kneser conjecture: reduce the question of whether a geometric statement is true to the nonexistence of an equivariant map between a test …
-
Models of 2D-scene complexity : a look at the intrinsic complexity of scenes
… of two-dimensional scenes will be explored. One problem is then looked at and analyzed with respect to the new models: the Binary Space Partition problem. Under the assumption that an input scene is considered to be simple by our most general model, the analysis reveals that such a scene will …
-
An Artificial Neural Approach to the Decomposition Problem
… intractability involved with the decomposition problem. The search for the lattice of substitution property (s. p.) partitions essential to decompositions is cast into the framework of constraint satisfaction. An artificial neural network is developed to provide solutions by performing …
-
Biclique Partitions, Biclique Covers, and Disjunctive Constraints
… and related combinatorial optimization problems: minimum biclique partition problem and minimum biclique cover problem. We introduce techniques to build small ideal mixed-integer programming (MIP) formulations of combinatorial disjunctive constraints (CDCs) via the independent branching …
-
Distributed quantum computing via enhanced connectivity
… (DQC). By modeling qubit interaction as a graph partition problem, we propose a joint optimization framework to minimize inter-QPU communication overhead. Our results demonstrate that the proposed linearized formulation, TACO-L, significantly outperforms traditional two-stage methods in executing …
-
Network partition for switched industrial ethernet using combined search heuristics
… daily communications, the network designer must partition the communicating devices into subnets each of which is supported by a high speed Ethernet. Then, the subnets are connected by a second level switch device called controller which handles inter-subnet communications. An optimization …
-
Artificial Immune Systems for Combinatorial Optimisation: A Theoretical Investigation
… benchmark function classes and of the NP-hard Partition problem. If the basin of attraction of the local optima is not too large, then ageing allows even greater speed-ups. For the Cliff benchmark function this can make the difference between exponential and quasi-linear expected time. If the …
-
Multi-resolution fault diagnosis in discrete-event systems
… node is isolated. In this way, the original problem of fault diagnosis is replaced by a sequence of smaller problems. The plant models used at each step of diagnosis are abstractions of the original plant model. We propose to use model reduction through the solutions of the Relational …
-
Lower Bounds and Algorithms for Searching Networks
… an invisible fugitive, the fast searching problem is to find the fast search number, i.e., the minimum number of searchers to capture the fugitive in the fast search model. This model was first introduced by Dyer, Yang and Ya¸sar in 2008. Although the literature provides a number of results …
-
<i>m</i>-ARY Partitions
We study the number of ways in which n ≥ 0 be written as the sum of powers of m ≥ 2. After briefly discussing historical results and examples, we prove recurrence relations, exact formulae, bounds, and asymptotic formulae. The proofs are based on elementary reasoning using induction and the mean …
-
Robust and Equitable Public Health Screening Strategies, with Application to Genetic and Infectious Diseases
… common features of both public health screening problems include large testing populations and resource limitations that inhibit screening efforts. Cost is a major barrier to the inclusion of genetic disorders in newborn screening, and thus screening must be both highly accurate and efficient; …
Page 1 of 2