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 95 for “"Problem Complexity"”.

  1. The k-labeled spanning forest problem : complexity, approximability, formulations and algorithms

    … work, we study the k-labeled spanning forest problem (KLSF). The input of the KLSF is an undirected graph with labeled edges and a positive integer k. The goal is to find a spanning forest of the graph with at most k different labels associated with the edges, that minimizes the number of …

    brazil-ufrgs Repository record for The k-labeled spanning forest problem : complexity, approximability, formulations and algorithms (opens in a new tab)

  2. The Effect of Problem Complexity on the Efficiency of Intuitive and Analytic Processes

    … process, while others suggest that increasing complexity forces analysis. This study was an attempt to resolve this question by manipulating rate of presentation and instructions. No effect was found due to these manipulations or due to complexity. The reason is not clear, but may be due to a …

    portland-state Repository record for The Effect of Problem Complexity on the Efficiency of Intuitive and Analytic Processes (opens in a new tab)

  3. Impact of Query Specification Mode and Problem Complexity on Query Specification Productivity of Novice Users of Database Systems

    … impact of system-provided user assistance and complexity level of the problem on novice users' productivity in specifying database queries. The study is theoretical in the sense that it presents an approach adopted from research in deductive database systems to attack problems concerning user …

    unt Repository record for Impact of Query Specification Mode and Problem Complexity on Query Specification Productivity of Novice Users of Database Systems (opens in a new tab)

  4. Complexity Scaling Laws for Neural Models using Combinatorial Optimization

    … In this work, we develop scaling laws based on problem complexity. We analyze two fundamental complexity measures: solution space size and representation space size. Using the Traveling Salesman Problem (TSP) as a case study, we show that combinatorial optimization promotes smooth cost trends, …

    vt Repository record for Complexity Scaling Laws for Neural Models using Combinatorial Optimization (opens in a new tab)

  5. The robust design of complex systems

    … system design. Applying these methods to large problems can be difficult and time-consuming because of the complexity of most design problems. It is the goal of this thesis to introduce methods which reduce problem complexity and so make the application of Robust Engineering Design (RED) …

    city-london Download PDF for The robust design of complex systems (opens in a new tab)

  6. The influence of self-efficacy and working memory capacity on problem solving efficiency

    … beliefs, working memory capacity and problem complexity on problem solving performance, response time, and problem solving efficiency. Previous research investigated these factors from an absolute performance perspective, but not from the perspective of efficiency, defined as the ratio …

    unlv Repository record for The influence of self-efficacy and working memory capacity on problem solving efficiency (opens in a new tab) Download PDF for The influence of self-efficacy and working memory capacity on problem solving efficiency (opens in a new tab)

  7. Rolling Horizon Workforce Schedule to Assign Workers to Tasks in a Learning/Forgetting Environment

    … function significantly increases problem complexity and solution difficulty as the length of planning horizon increases. In this thesis, a multi-period rolling horizon worker-task assignment framework is developed to overcome computational challenges associated with longer planning …

    rit Repository record for Rolling Horizon Workforce Schedule to Assign Workers to Tasks in a Learning/Forgetting Environment (opens in a new tab)

  8. A Life Cycle Software Quality Model Using Bayesian Belief Networks

    … team skill/experience, process maturity, and problem complexity throughout the software engineering life cycle. The model is structured using Bayesian Belief Networks and, unlike previous efforts, uses widely-accepted software engineering standards and in-use industry techniques to quantify …

    ucf Repository record for A Life Cycle Software Quality Model Using Bayesian Belief Networks (opens in a new tab)

  9. Analysis of oil-pipeline distribution of multiple products subject to delivery time-windows

    This dissertation defines the operational problems of, and develops solution methodologies for, a distribution of multiple products into oil pipeline subject to delivery time-windows constraints. A multiple-product oil pipeline is a pipeline system composing of pipes, pumps, valves and storage …

    tamu Repository record for Analysis of oil-pipeline distribution of multiple products subject to delivery time-windows (opens in a new tab)

  10. Alayzing The Effects Of Modularity On Search Spaces

    We are continuously challenged by ever increasing problem complexity and the need to develop algorithms that can solve complex problems and solve them within a reasonable amount of time. Modularity is thought to reduce problem complexity by decomposing large problems into smaller and less complex …

    ucf Repository record for Alayzing The Effects Of Modularity On Search Spaces (opens in a new tab)

  11. Neural Network Pruning for ECG Arrhythmia Classification

    … of solving complex classification and detection problems in imaging and speech. However, problem complexity often leads to considerable increases in computation and parameter storage costs. Many successful attempts have been made in effectively reducing these overheads by pruning and compressing …

    calpoly Repository record for Neural Network Pruning for ECG Arrhythmia Classification (opens in a new tab)

  12. Adaptive Scheduling Systems: A decision-theoretic approach

    … mainly focuses on solving the dynamic job-shop problems where high uncertainties and problem complexity greatly affect the quality of schedules generated. This thesis proposes an adaptive scheduling system based on decision theory. Influence diagram is used as the main modeling tool in the …

    nus Repository record for Adaptive Scheduling Systems: A decision-theoretic approach (opens in a new tab) Download file for Adaptive Scheduling Systems: A decision-theoretic approach (opens in a new tab)

  13. Anticipations of effort and accuracy in multiattribute choice

    … it will yield. Independent variables include problem complexity, information display organization, and explicit feedback availability. The second experiment was similar to the first, further examining the effects of explicit accuracy feedback. The results of these two experiments indicate that …

    uiuc Repository record for Anticipations of effort and accuracy in multiattribute choice (opens in a new tab)

  14. Dynamic Electronic Asset Allocation Comparing Genetic Algorithm With Particle Swarm Optimization

    … this Electronic Warfare Asset Allocation Problem (EWAAP) with the Genetic Algorithm (GA); 2) Comparing performance of Genetic Algorithm to Particle Swarm Optimization (PSO) algorithm. This research problem implemented Genetic Algorithm in C++ and used QT Data Visualization for displaying …

    iupui Repository record for Dynamic Electronic Asset Allocation Comparing Genetic Algorithm With Particle Swarm Optimization (opens in a new tab)

  15. Deep Learning Methods for Real-Time Speech & Audio

    … My research tackles two classes of such problems on opposite ends of the spectrum regarding latency requirements and problem complexity. At the lower end of latency tolerance, we propose semantic hearing, a set of methods for semantically customizing one's perceived acoustic environment, …

    washington Repository record for Deep Learning Methods for Real-Time Speech & Audio (opens in a new tab)

  16. TANDI: Threat Assessment of Network Data and Information

    … actions. The algorithm, TANDI, reduces the problem complexity by separating the models of the attacker's capability and opportu nity, and fuse the two to determine the attacker's intent. Unlike traditional Bayesian-based approaches, which require assigning a large number of edge …

    rit Repository record for TANDI: Threat Assessment of Network Data and Information (opens in a new tab)

  17. Detecting Tangled Logic Structures in VLSI Netlists

    This thesis proposes a new problem of identifying large and tangled logic structures in a synthesized netlist. Large groups of cells that are highly interconnected to each other can often create potential routing hotspots that require special placement constraints. They can also indicate …

    tamu Repository record for Detecting Tangled Logic Structures in VLSI Netlists (opens in a new tab)

  18. Solving Chromatic Number with Quantum Search and Quantum Counting

    … algorithm that solves the Chromatic Number problem. Complexity analysis of this algorithm revealed a run time of O(2n/2n2(log2n)2). This is an improvement over the best known algorithm, with a run time of 2nnO(1) [1]. This algorithm uses the Quantum Search algorithm (often called Grover's …

    calpoly Repository record for Solving Chromatic Number with Quantum Search and Quantum Counting (opens in a new tab)

  19. Symmetries infused safe and scalable multi-robot policies

    … quantification methods, reduces effective problem complexity and improves efficiency and generalization — setting symmetry exploitation as a foundational principle for safe and scalable multi-robot intelligence. The first part of this dissertation studies symmetry-aware decentralized policy …

    penn Repository record for Symmetries infused safe and scalable multi-robot policies (opens in a new tab)

Page 1 of 5