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

  1. Interfacial partitioning during solidification.

    Massachusetts Institute of Technology. Dept. of Metallurgy and Materials Science. Thesis. 1970. Ph.D.

    mit Repository record for Interfacial partitioning during solidification. (opens in a new tab)

  2. Dynamic partitioning of social networks

    In this thesis, I study the problem of dynamic partitioning of online social networks (OSN). The problem is practically important since it lays the foundation of many applications. If OSN users are treated as vertices and their connections, like friendships or conversations, as edges, social …

    uiuc Repository record for Dynamic partitioning of social networks (opens in a new tab)

  3. Chromosome partitioning in Bacillus subtilis

    Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Biology, 1999.

    mit Repository record for Chromosome partitioning in Bacillus subtilis (opens in a new tab)

  4. Fenrir: Practical Algorithms for Cache Partitioning

    … project, we investigate the problem of cache partitioning. Cache partitioning concerns the following question: given a number of tenants (think corporate customers) on a single server, how much cache space should each tenant be allotted? Moreover, given a set of tenants and a set of servers, …

    reykjavik Repository record for Fenrir: Practical Algorithms for Cache Partitioning (opens in a new tab)

  5. Partitioning Biological and Anthropogenic Methane Sources

    <p>Methane is an important greenhouse gas, and an ideal target for greenhouse gas emissions reductions. Unlike carbon dioxide, methane has a relatively short atmospheric lifetime, so reductions in methane emissions could have large and immediate impacts on anthropogenic radiative forcing. A more …

    duke Repository record for Partitioning Biological and Anthropogenic Methane Sources (opens in a new tab)

  6. Partitioning algorithms for parallel circuit simulation

    … an opportunity to speed up the simulation by partitioning the circuit so that the computation may be spread among the processors. To accomplish this, the circuit is partitioned into subcircuits using a node tearing method. If the circuit matrix is ordered subcircuit by subcircuit followed by …

    uiuc Repository record for Partitioning algorithms for parallel circuit simulation (opens in a new tab)

  7. AdaptDB : adaptive partitioning for distributed joins

    … the network. Many techniques based on data partitioning have been proposed to reduce the amount of data that must be accessed, often focusing on finding the best partitioning scheme for a particular workload, rather than adapting to changes in the workload over time. In this thesis, we …

    mit Repository record for AdaptDB : adaptive partitioning for distributed joins (opens in a new tab)

  8. Optimizing Partitioning for Efficient Parallel Reads

    … avoid scanning the entire database. When this partitioning is optimized to minimize the number of blocks accessed by each query, smaller queries that access very few blocks fail to fully utilize the bandwidth because they cannot take advantage of parallel reading. However, reducing the size of …

    mit Repository record for Optimizing Partitioning for Efficient Parallel Reads (opens in a new tab)

  9. Wavelength partitioning in WDM ring networks

    Thesis (S.B. and M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2000.

    mit Repository record for Wavelength partitioning in WDM ring networks (opens in a new tab)

  10. Malleable Contextual Partitioning and Computational Dreaming

    … solution is a method for Malleable Contextual Partitioning (MCP) that enables closer personalization to user behavior. We conceptualize a novel architectural framework, the Dream Architecture for Lateral Intelligence (DALI) that demonstrates the MCP approach. The DALI implements a dream phase …

    vt Repository record for Malleable Contextual Partitioning and Computational Dreaming (opens in a new tab)

  11. Partitioning Strategies to Enhance Symbolic Execution

    … many paths. In this paper, we present two partitioning strategies in order to mitigate this problem, consequently reducing unnecessary SMT solver calls as well. In sequential partitioning, code sections are analyzed sequentially to take advantage of infeasible paths discovered in earlier …

    vt Repository record for Partitioning Strategies to Enhance Symbolic Execution (opens in a new tab)

  12. 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)

  13. Algorithms For Haplotype Inference And Block Partitioning

    The completion of the human genome project in 2003 paved the way for studies to better understand and catalog variation in the human genome. The International HapMap Project was started in 2002 with the aim of identifying genetic variation in the human genome and studying the distribution of …

    ucf

  14. FPGA-based implementation of parallel graph partitioning

    Graph partitioning is a very important application that can be found in numerous areas, from finite element methods to data processing and VLSI circuit design. Many algorithms have been developed to solve this problem. Of special interest is multilevel graph partitioning that provides a very …

    njit Repository record for FPGA-based implementation of parallel graph partitioning (opens in a new tab)

  15. Food Partitioning Between Two Sympatric Cricetid Species

    … sympatric species avoid competition by partitioning resources. The extent of niche overlap and resource partitioning can be determined by studying food habits of sympatric species. Microtus ochrogaster and Peromyscus maniculatus occur sympatrically at the Southwest Missouri State …

    mo-state Repository record for Food Partitioning Between Two Sympatric Cricetid Species (opens in a new tab)

  16. Carbon partitioning in nitrogen-fixing root nodules

    Stickstoff-fixierende Wurzelnknöllchen repräsentieren starke Kohlenstoff- sinks". Die Zucker- verteilung wurde in verschiedenen symbiotischen Systemen untersucht, nämlich in einer Leguminose, Medicago truncatula, und zweier Aktinorhizapflanzen, Casuarina glauca und Datisca glomerata. Die …

    goettingen Repository record for Carbon partitioning in nitrogen-fixing root nodules (opens in a new tab)

  17. An effective algorithm for multiway hypergraph partitioning

    The problem of hypergraph partitioning has been around for more than a quarter of a century. Its early applications were centered on VLSI circuit design. In recent years, the application of hypergraph partitioning has been extended into the areas including data classifications, efficient storage of …

    concordia Repository record for An effective algorithm for multiway hypergraph partitioning (opens in a new tab)

  18. Modular Specification of Partitioning and Distribution Strategies

    We illustrate the use of our language support for parallel algorithms based on irregular structures which may require dynamic adjustment of load across processors. A fast runtime kernel is used to run the programs on CM-5. In spite of the ease of programming offered by the language, the portability …

    uiuc Repository record for Modular Specification of Partitioning and Distribution Strategies (opens in a new tab)

Page 1 of 81