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 “"Greedy Search"”.

  1. Efficient 𝐻₂-Based Parametric Model Reduction via Greedy Search

    … 𝐻-infinity approximations, we develop a greedy algorithm for efficiently modeling large-scale parametric dynamical systems in an 𝐻₂-sense. We demonstrate the effectiveness of this greedy search on a fluid problem, a mechanics problem, and a thermal problem. We also investigate Bayesian …

    vt Repository record for Efficient 𝐻₂-Based Parametric Model Reduction via Greedy Search (opens in a new tab)

  2. A Greedy Search Algorithm for Maneuver-Based Motion Planning of Agile Vehicles

    This thesis presents a greedy search algorithm for maneuver-based motion planning of agile vehicles. In maneuver-based motion planning, vehicle maneuvers are solved offline and saved in a library to be used during motion planning. From this library, a tree of possible vehicle states can be …

    vt Repository record for A Greedy Search Algorithm for Maneuver-Based Motion Planning of Agile Vehicles (opens in a new tab)

  3. Hybrid Nested Partitions method with Intelligent Greedy Search for solving Weapon-Target Assignment Problem

    … of military applications of operations research. The objective of the WTA problem is to find proper assignments of weapons to targets which minimize the expected damage of defensive side. The WTA problem is known to be NP-complete. In this paper, hybrid Nested Partitions (NP) method is …

    iastate Repository record for Hybrid Nested Partitions method with Intelligent Greedy Search for solving Weapon-Target Assignment Problem (opens in a new tab)

  4. Machine learning as massive search

    … patterns from data. Machine-learning algorithms search large spaces of potential hypotheses for the hypothesis that best fits the data. Since the search space for most induction problems grows exponentially in the number of features used to describe the data, most induction algorithms use greedy …

    washington Repository record for Machine learning as massive search (opens in a new tab)

  5. Attention and Sensor Planning in Autonomous Robotic Visual Search

    … with the incorporation of saliency in visual search and the development of sensor planning strategies for visual search. The saliency model is a mixture of two schemes that extracts visual clues regarding the structure of the environment and object specific features. The sensor planning …

    york Repository record for Attention and Sensor Planning in Autonomous Robotic Visual Search (opens in a new tab)

  6. Optimization of Quantization Levels for Analog-to-Digital Converters Based on Discrete Multitone Signals

    … GS/s. Three non-uniform ADC designs—Lloyd-Max, greedy search, and piecewise-uniform (segmented)—are compared with uniform quantization. Across all sampling rates and both channels, non-uniform quantization outperforms uniform at the same level count, with a consistent ranking of Lloyd-Max, …

    carleton Repository record for Optimization of Quantization Levels for Analog-to-Digital Converters Based on Discrete Multitone Signals (opens in a new tab)

  7. Automatic Collection Selection using Machine Learning

    … Finally, we compare JBrainy's suggestions versus greedy search, on five well known benchmarks. Our investigations show that JBrainy's suggestions were almost as effective than those of greedy search in minimizing the running time of programs. However, we also find that Brainy's benchmark synthesis …

    lund Repository record for Automatic Collection Selection using Machine Learning (opens in a new tab) Download PDF for Automatic Collection Selection using Machine Learning (opens in a new tab)

  8. Efficient Bayesian Network Inference: Genetic Algorithms, Stochastic Local Search, and Abstraction

    Two major research results are presented that relate to creating hard synthetic Bayesian networks for empirical research on inference algorithms. One method translates deceptive problems studied in genetic algorithms to a Bayesian network setting, showing that Bayesian networks can be deceptive. …

    uiuc Repository record for Efficient Bayesian Network Inference: Genetic Algorithms, Stochastic Local Search, and Abstraction (opens in a new tab)

  9. Resilient dynamic state estimation in the presence of false information injection attacks

    … the prohibitive complexity of the exhaustive search, polynomial-time algorithms, such as greedy search and dynamic programming, are proposed to find the suboptimal attack strategies. As for greedy search, it starts with an empty set, and one sensor is added at each iteration, whose elimination …

    vcu Repository record for Resilient dynamic state estimation in the presence of false information injection attacks (opens in a new tab)

  10. Evolutionary Algorithms for Hyperparameter Search in Machine Learning

    … values are determined empirically, typically by search. From the research that has been done in this area, approaches for automating the search of hyperparameters mainly fall into the following categories: manual search, greedy search, random search, Bayesian model-based optimization, and …

    unsw Repository record for Evolutionary Algorithms for Hyperparameter Search in Machine Learning (opens in a new tab)

  11. CONSTRAINED DEEP REINFORCEMENT LEARNING FOR ROBOT-ASSISTED SURGICAL TRAINING WITH SOFT TISSUE DEFORMATION

    … We present an uncertainty-aware Model-Based Greedy Search (MBGS) algorithm for constrained RL, promoting safety during DRL training. The laparoscopic surgery task is specified as a target-reaching task, guiding the robot to move the end effector to a given target point in/around the liver …

    nus Repository record for CONSTRAINED DEEP REINFORCEMENT LEARNING FOR ROBOT-ASSISTED SURGICAL TRAINING WITH SOFT TISSUE DEFORMATION (opens in a new tab) Download file for CONSTRAINED DEEP REINFORCEMENT LEARNING FOR ROBOT-ASSISTED SURGICAL TRAINING WITH SOFT TISSUE DEFORMATION (opens in a new tab)

  12. A General Model for Continuous Noninvasive Pulmonary Artery Pressure Estimation

    … and risk of invasive monitoring. We conduct a greedy search through 38 possible features using a 109-patient cross-validation to find the most predictive features. Our best general model has a standard estimate of error (SEE) of 8.28 mmHg, which outperforms the previous best performance in the …

    byu Repository record for A General Model for Continuous Noninvasive Pulmonary Artery Pressure Estimation (opens in a new tab) Download PDF for A General Model for Continuous Noninvasive Pulmonary Artery Pressure Estimation (opens in a new tab)

  13. Optimal Screening for Preclinical Diseases

    … model, and that it can be quickly found by any greedy-search algorithm. We further conduct numerical experimentations by which we identify sensitive model inputs. We lastly apply our model to breast cancer screening using practical information and we investigate additional characteristics of …

    tamu Repository record for Optimal Screening for Preclinical Diseases (opens in a new tab)

  14. Directed model checking for timed automata

    … of the thesis. Here, different heuristics and search enhancements for directed model checking are introduced. In chapter 5, the most successful relaxation from AI planning is adapted and extended to directed model checking of timed automata. With the resulting heuristics it is possible to …

    freiburg-diss Repository record for Directed model checking for timed automata (opens in a new tab)

  15. Closest convex function approximation with minimal pieces for univariate piecewise linear-quadratic functions

    … Finally, we develop an algorithm rooted in greedy search preprocessing and dichotomic search strategy utilizing an optimization model, to approximate a given univariate PLQ function with another PLQ function containing minimal number of pieces while adhering to a specified error tolerance. …

    ubc Repository record for Closest convex function approximation with minimal pieces for univariate piecewise linear-quadratic functions (opens in a new tab) Download PDF for Closest convex function approximation with minimal pieces for univariate piecewise linear-quadratic functions (opens in a new tab)

  16. Enabling Open Source Intelligence (OSINT) in private social networks

    … this work we review existing social networking research to examine how it can be applied to OSINT. As our contribution, we propose a greedy search algorithm for enabling efficient discovery of private friends on social networking sites and evaluate its performance on multiple randomly generated …

    iastate Repository record for Enabling Open Source Intelligence (OSINT) in private social networks (opens in a new tab)

  17. Alternative Bases for Gradient Based Optimization of Parameterized FM Radar Waveforms

    … that can be optimized (e.g. gradient descent and greedy search have been demonstrated). Because these structures must include oversampling with respect to 3-dB bandwidth to account for sufficient spectral roll-off (necessary to be physically realizable in hardware), they are not true bases (i.e. …

    ku Repository record for Alternative Bases for Gradient Based Optimization of Parameterized FM Radar Waveforms (opens in a new tab)

  18. An adaptive measurement protocol for fine-grained electromagnetic side-channel analysis of cryptographic modules

    … identifying the optimal configurations requires searching among a large number of possible configurations. The proposed protocol is a multi-step acquisition that corresponds to a greedy search in a 4-D configuration space consisting of probe’s on-chip coordinates, orientation, and number of …

    texas Repository record for An adaptive measurement protocol for fine-grained electromagnetic side-channel analysis of cryptographic modules (opens in a new tab)

  19. Developing a one-to-many generation LLM for diverse, accurate and efficient retrosynthesis

    … predictions of reactants. Chemformer uses beam search or multinomial search to get multiple predictions, which results in a lack of diversity, accuracy and efficiency of the model. In this project, the sphere projection strategy, which is a one-to-many generation strategy, was applied to …

    chalmers Repository record for Developing a one-to-many generation LLM for diverse, accurate and efficient retrosynthesis (opens in a new tab)

  20. Synthesis of stylized walking controllers for planar bipeds

    … these nodes and their associated actions. We use greedy search to find an optimized controller given an intuitive objective function. Importantly, several shaping techniques are used to ensure that local minima in the optimization space define good, meaningful solutions. We demonstrate the ability …

    ubc Repository record for Synthesis of stylized walking controllers for planar bipeds (opens in a new tab) Download PDF for Synthesis of stylized walking controllers for planar bipeds (opens in a new tab)

Page 1 of 4