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 71 for “"Partitioning problem"”.

  1. Exploiting consecutive ones structure in the set partitioning problem

    The Set Partitioning Problem (SPP) is one of the most extensively researched models in integer optimization, and is widely applied in operations research. SPP is used for crew scheduling, vehicle routing, stock cutting, production scheduling, and many other combinatorial problems. The power and …

    nps Repository record for Exploiting consecutive ones structure in the set partitioning problem (opens in a new tab)

  2. Novel Solutions and Applications of the Object Partitioning Problem

    This thesis considers the fundamental problem of "partitioning" which is all- pervasive in computer science. It has applications in "Big Data" because the vast amounts of data encountered in "Big Data" applications cannot be processed in a sin- gle block, but are better analyzed when it is …

    carleton Repository record for Novel Solutions and Applications of the Object Partitioning Problem (opens in a new tab)

  3. A study of the k-way graph partitioning problem

    O problema de particionamento balanceado de grafos consiste em encontrar uma partição de tamanho k dos vértices de um grafo, minimizando o número de arestas que participam do corte tal que o tamanho de nenhuma parte exceda [en~k], para algum e e > [1, k). Essa dissertação estuda esse problema, …

    brazil-ufrgs Repository record for A study of the k-way graph partitioning problem (opens in a new tab)

  4. On Maximum Weight Independent Sets and the Set Partitioning Problem

    Made available in DSpace on 2014-12-14T13:09:44Z (GMT). No. of bitstreams: 1 8009103.pdf: 2080632 bytes, checksum: 8b27f27acb1dd7e80416171889173a3d (MD5) Previous issue date: 1979

    uiuc Repository record for On Maximum Weight Independent Sets and the Set Partitioning Problem (opens in a new tab)

  5. Algorithms and hardware for the solution of set partitioning problems

    … is concerned with an integer linear programming problem, called the set partitioning problem. The problem is: minimize cx, subject to Ax=e, where A is a binary matrix, e is a column of ones, and c is a cost vector. Despite its particularly simple structure, the set partitioning problem has …

    ubc Repository record for Algorithms and hardware for the solution of set partitioning problems (opens in a new tab) Download PDF for Algorithms and hardware for the solution of set partitioning problems (opens in a new tab)

  6. A New Approach to Machine Learning Hardware Classifier Design Based on Functional Decomposition of Multi-Valued Functions

    … an approach to solve the column multiplicity problem, an approach to encode multiple-valued variables, and a decomposition algorithm based on modified Ashenhurst-Curtis Decomposition. One of the biggest challenges in Boolean function decomposition is the variable partitioning problem. Thus, we …

    portland-state Repository record for A New Approach to Machine Learning Hardware Classifier Design Based on Functional Decomposition of Multi-Valued Functions (opens in a new tab)

  7. Some Graph Partitioning Algorithms based on belief propagation

    … project we have focused on a kind of graph partitioning problem com- monly called bi-categorical clustering, however, we also show that all results are easily extended to general graph partitioning. In this problem we get a graph asked to output a partitioning and such that the partitions …

    chalmers Repository record for Some Graph Partitioning Algorithms based on belief propagation (opens in a new tab)

  8. Quantum Algorithms for Integer Programming Problems

    … in solving integer programming optimization problems. Specifically, the research investigates the application of Quantum Walks to address the Generalized Birkhoff Polytope of the Transportation Problem, as well as the application of the hybrid quantum-classical Variational Quantum Eigensolver …

    ttu Repository record for Quantum Algorithms for Integer Programming Problems (opens in a new tab)

  9. Partitioning Methods and Algorithms for Configurable Computing Machines

    This thesis addresses the partitioning problem for configurable computing machines. Specifically, this thesis presents algorithms to partition chain-structured task graphs across configurable computing machines. The algorithms give optimal solutions for throughput and total execution time for these …

    vt Repository record for Partitioning Methods and Algorithms for Configurable Computing Machines (opens in a new tab)

  10. Decomposing rectilinear regions into rectangles

    This thesis discusses the problem of decomposing rectilinear regions, with or without holes, into a minimum number of rectangles. There are two different types of decomposition considered here : decomposing a figure into non-overlapping parts, called partitioning, and decomposing a figure into …

    vt Repository record for Decomposing rectilinear regions into rectangles (opens in a new tab)

  11. Design and Development of Adaptive Intrusion Management for Cyber-Based Systems

    … In particular, we propose an adaptive data Partitioning-based Intrusion Management System (PIMS) that can endure intense malicious intrusion attacks on Database Management Systems (DBMSs). The novelty of PIMS is a data partitioning scheme that provides the ability to contain the damage in …

    purdue-thes Repository record for Design and Development of Adaptive Intrusion Management for Cyber-Based Systems (opens in a new tab)

  12. On a Free-Endpoint Isoperimetric Problem

    Inspired by a planar partitioning problem involving multiple unbounded chambers, this thesis investigates using classical techniques what can be said of the existence, uniqueness, and regularity of minimizers in a certain free-endpoint isoperimetric problem. In two cases, a full …

    mcmaster Repository record for On a Free-Endpoint Isoperimetric Problem (opens in a new tab)

  13. Computational advances in the solution of large-scale covering and set partitioning problems

    The Set Covering Problem (SCP) and the Set Partitioning Problem (SPP) represent an important class of all-binary (0-1) Integer Linear Programs (ILP). A review of the literature reveals extensive application of the SPP/SCP model to a wide set of practical problems. The basic model is explained, and …

    nps Repository record for Computational advances in the solution of large-scale covering and set partitioning problems (opens in a new tab)

  14. Video segmentation: Temporally-constrained graph-based optimization

    … segmentation into a highly constrained graph partitioning problem. All unlabeled subgraphs are spatially aggregated for the final grouping. Experimental results show that the proposed approach is highly efficient for the spatio-temporal segmentation and it produces encouraging results.

    nus Repository record for Video segmentation: Temporally-constrained graph-based optimization (opens in a new tab) Download file for Video segmentation: Temporally-constrained graph-based optimization (opens in a new tab)

  15. Connection routing and configuration in optical burst switching networks

    … end-to-end loss guaranteed connections and two problems in configuring end-to-end loss guaranteed connections, which are the loss budget partitioning problem and the loss threshold selection problem.

    nus Repository record for Connection routing and configuration in optical burst switching networks (opens in a new tab) Download file for Connection routing and configuration in optical burst switching networks (opens in a new tab)

  16. Partitioning a given circuit targeting multiple Fpgas

    Our approach to the problem of partitioning the design (represented as a hypergraph) into Multi-FPGAs uses a bi-level approach by initially clustering the design and then applying the bipartitioning technique iteratively. Each partition generated by the iterative bipartitioning technique should …

    unlv Repository record for Partitioning a given circuit targeting multiple Fpgas (opens in a new tab) Download PDF for Partitioning a given circuit targeting multiple Fpgas (opens in a new tab)

  17. An Investigation Of Parallel Methods For VLSI Circuit Partitioning

    … for finding solutions to the VLSI Circuit Partitioning problem. We combine parallel methods with the Fidducia-Mattheyses, Memetic Algorithm, and Scatter Search advanced search techniques to find near optimal solutions in a reasonable amount of time. We examine a total nine algorithms, three …

    guelph Repository record for An Investigation Of Parallel Methods For VLSI Circuit Partitioning (opens in a new tab)

  18. Modeling and algorithmic development of a staff scheduling problem

    … a mathematical model to solve the scheduling problem, with attention focused on minimizing the number of workers required on a particular shift and on finding the feasible assignments of workers to trucks and vice-versa. We show that this is a set partitioning problem with an additional …

    vt Repository record for Modeling and algorithmic development of a staff scheduling problem (opens in a new tab)

Page 1 of 4