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 31 for “"Problem Complexity"”.
-
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, …
-
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) …
-
Factored State Abstraction for Option Learning
… solutions for long-horizon decision-making problems with sparse rewards. One promising approach that learns these options end-toend in this setting is the option-critic (OC) framework. However, there are several practical limitations of this method, including the lack of diversity between …
-
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 …
-
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 …
-
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 …
-
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 …
-
A Computational Framework for Dimensionally Reduced Particle Dynamics in Magnetic Nozzle Fields: An Adiabatic Invariant Approach
… three-dimensional Hamiltonian formulation, the problem is reduced to two dimensions via angular momentum conservation, then further simplified to one dimension through the introduction of an adiabatic invariant J, which characterizes periodic radial motion. The validity of this dimensional …
-
Parameter reduction in deep learning and classification
… thesis is to develop methods to reduce model and problem complexity in the area of classification tasks. Whether it is a traditional or a deep learning classification task, decreasing complexity helps to greatly improve efficiency, and also adds regularization to the models. In traditional machine …
-
The Modeling Spectrum of Data-Driven Decision Making
… from model-based to applied, depending on the problem complexity and data availability. This thesis studies three settings that span the modeling spectrum in the contexts of digital agriculture, cell reprogramming, and pandemic policymaking. First, we investigate the problem of learning good …
-
Characterization of adhesively bonded joints using bulk adhesive properties
… adhesives. Due to computer time constraints and problem complexity, a complete analysis including a time dependent, viscoelastic analysis was not possible. The linear elastic case analyzed gave important insight into the magnitudes of stresses to be expected in a typical joint. It was found that …
-
Performance Appraisal of Estimation Algorithms and Application of Estimation Algorithms to Target Tracking
… of estimation theory and the increase of problem complexity, performance appraisal is getting more and more challenging for engineers to make comprehensive conclusions. However, the existing theoretical results are inadequate for practical reference. The first part of this dissertation is …
-
Evacuation Network Optimization: Models, Solution Methods and Applications
… network capacity and connectivity. The core problem posed in this text is a network optimization problem with regard to two lane-based planning strategies: lane reversal on roadway sections and crossing elimination at intersections. These strategies supplement one another by increasing …
-
Speedup of MCNP(X) parallel KCODE execution via communication algorithm development and Beowulf Cluster optimization
… performance gain opens a whole new level of problem complexity for a relatively low cost.
-
Efficient planning for near-optimal contact-rich control under uncertainty
… that create difficulties for planning. This complexity is usually addressed by discretization over state and action space, but discretization quickly leads to computationally intractability if the optimal solution is desired. To overcome the challenge, we use the insight that only actions on …
-
Factors influencing bus network design
… and frequency setting, the highest level subproblems in the bus planning process, have long-term impacts on bus network performance. Improving network performance not only improves the attractiveness of public transport and thus ridership, but cost-effectiveness as well because public …
-
Optimization and Verification Techniques for Hardware Synthesis from Concurrent Action-Oriented Specifications
… synthesis process. In this work, we analyze the complexity of low-power problems associated with the action-oriented specification models, and propose algorithms and techniques for power optimization during the action-oriented synthesis process. Furthermore, verification of hardware designs …
-
Algorithms for phylogenetic tree correction in species and cancer evolution
… from molecular sequence data is a fundamental problem in computational biology. Classically, evolutionary trees have been estimated over a set of species, where leaves correspond to extant species and internal nodes correspond to ancestral species. This type of phylogeny is colloquially thought …
-
Configuration of Microgrids Considering State Estimation, Service Restoration, and Integration with Natural Gas Systems
… the need for a central unit and reduce the problem complexity, the optimization problem is reformulated using distributed automated agents. Third, a new model is proposed for optimal scheduling of power-to-gas (PtG), gas-fired generation (GfG), and gas storage units in a multi-carrier energy …
-
Wireless sensor network aided search and rescue in trails
… is minimized. Particularly, we address two problems: a) how to identify the lost hiker position as accurately as possible, i.e., obtain a small search region containing the lost hiker; and (b) how to search efficiently in search regions for different trail topologies and search agent …
Page 1 of 2