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 128 for “"Stochastic Search"”.

  1. Information theoretic stochastic search

    Optimization is the research field that studies the design of algorithms for finding the best solutions to problems we may throw at them. While the whole domain is practically important, the present thesis will focus on the subfield of continuous black-box optimization, presenting a collection of …

    minho-thes Repository record for Information theoretic stochastic search (opens in a new tab)

  2. Protein Identification Using Bayesian Stochastic Search

    … mass spectrometry (MS/MS) involve database searches or de novo peptide sequencing, with database searches being the standard method. With database searches, issues arise when the species is not in the database. Shortcomings of de novo peptide sequencing and database searches include chemical …

    south-carolina Repository record for Protein Identification Using Bayesian Stochastic Search (opens in a new tab)

  3. Stochastic search methodologies for multi-objective simulation optimization

    … designing various types of multiobjective (MO) search algorithms. Based on the framework, two specific algorithms are designed. First is an advanced stochastic search algorithm multi-objective convergent optimization via most-promising-area stochastic search (MO-COMPASS) that is developed with …

    nus Repository record for Stochastic search methodologies for multi-objective simulation optimization (opens in a new tab) Download file for Stochastic search methodologies for multi-objective simulation optimization (opens in a new tab)

  4. Adversarial and Stochastic Search for Mobile Targets in Complex Environments

    … precision agriculture, space exploration, and search-and-rescue operations. Most of the robotics applications involve a ``search'' component. In a search mission, the searcher is looking for a mobile target while the target is avoiding capture intentionally or obliviously. Some examples are …

    umn Repository record for Adversarial and Stochastic Search for Mobile Targets in Complex Environments (opens in a new tab)

  5. Quantifying stochastic search: a unifying approach via lattice random walks

    Stochastic search plays a crucial role in many natural and artificial phenomena across scales and disciplines. Examples range from the spread of misinformation in online social networks to resource collection by animals. Quantifying the efficiency with which the search occurs has a long and rich …

    bristol Repository record for Quantifying stochastic search: a unifying approach via lattice random walks (opens in a new tab) Download PDF for Quantifying stochastic search: a unifying approach via lattice random walks (opens in a new tab)

  6. Stochastic search gene suggestion: Hierarchical Bayesian model selection meets gene mapping

    … regression model used in gene mapping. We chose Stochastic Search Variable Selection for its use of latent indicator variables to indicate those covariates, in this case genes, important to the model. We extended the latent variable structure to mirror genetics through a latent allele indicator …

    rice Repository record for Stochastic search gene suggestion: Hierarchical Bayesian model selection meets gene mapping (opens in a new tab)

  7. The non-equilibrium statistical physics of stochastic search, foraging and clustering

    … processes, and Brownian motion to model basic stochastic search processes found in biology and ecological systems. The second is centered around clustered networks: how clustering modifies the nature of transition in the appearance of various graph motifs and their use in modeling social …

    bu Repository record for The non-equilibrium statistical physics of stochastic search, foraging and clustering (opens in a new tab)

  8. Identifying historical financial crisis: Bayesian stochastic search variable selection in logistic regression

    … a rapid Bayesian variable selection technique - Stochastic Search Variable Selection (SSVS) using a Bayesian logistic regression model. Finally, we analyzed the result of SSVS, leading to the conclusion that that the dummy variable we created for disastrous hurricane, crude oil price and gold …

    texas Repository record for Identifying historical financial crisis: Bayesian stochastic search variable selection in logistic regression (opens in a new tab)

  9. Stochastic Search Genetic Algorithm Approximation of Input Signals in Native Neuronal Networks

    … network by transmission between neurons. The research focuses on the regeneration of the output signal of the network without knowing the original input signal. The computational complexity of the problem is prohibitive for the exact computation. We propose to use a heuristic approach called …

    ottawa-retro Repository record for Stochastic Search Genetic Algorithm Approximation of Input Signals in Native Neuronal Networks (opens in a new tab)

  10. Adaptive Bayes-Optimal Methods for Stochastic Search with Applications to Preference Learning

    … problems in mathematics can be considered search problems, where one can make sequential queries to find a point with desired properties. This includes convex optimization, in which queries are points within the feasible region, and the corresponding subgradient implies a separating …

    cornell Repository record for Adaptive Bayes-Optimal Methods for Stochastic Search with Applications to Preference Learning (opens in a new tab)

  11. Bayesian analysis of multivariate stochastic volatility and dynamic models

    … is of unknown nature, may be deterministic or stochastic. We propose Bayesian stochastic search as a feasible variable selection technique for the regression and volatility equations. We develop Markov Chain Monte Carlo (MCMC) algorithms that generate a posteriori restrictions on the elements …

    missouri Repository record for Bayesian analysis of multivariate stochastic volatility and dynamic models (opens in a new tab)

  12. WHICH: A stochastic best-first search learner.

    Rule-based learners search a version space of combinations of features. Starting at “false”, features can be added using disjunctions, conjunctions and negations which can combine to some top-most “true” node that covers all possible examples. A complete search of all possible combinations can be …

    wvu Repository record for WHICH: A stochastic best-first search learner. (opens in a new tab)

  13. Bayesian Sparse Learning for High Dimensional Data

    … challenge in Bayesian variable selection is to search the huge model space adequately, while identifying high posterior probability regions. In the past decades, the main focus has been on the use of Markov chain Monte Carlo (MCMC) algorithms for these purposes. In the first part of this thesis, …

    duke Repository record for Bayesian Sparse Learning for High Dimensional Data (opens in a new tab)

  14. New model-based methods for non-differentiable optimization

    … optimization, discrete gradient-based adaptive stochastic search (discrete-GASS) and annealing gradient-based adaptive stochastic search (annealing-GASS), under the framework of gradient-based adaptive stochastic search (GASS), where the parameter of the probabilistic model is updated based on a …

    uiuc Repository record for New model-based methods for non-differentiable optimization (opens in a new tab)

  15. An efficient routing tree construction algorithm with buffer insertion, wire sizing and obstacle considerations

    … be broken down into several components. We apply stochastic search to find the best specification. Since we need very few high-level features to evaluate a routing tree, the size of stochastic search space is small which can be searched in very less time. The solutions for the components are …

    iastate Repository record for An efficient routing tree construction algorithm with buffer insertion, wire sizing and obstacle considerations (opens in a new tab)

  16. Faster Evolutionary Multi-Objective Optimization via GALE, the Geometric Active Learner

    … thousands of papers that discuss methods for the search of optimal solutions to complex problems. In the case of multi-objective optimization, such a search yields iteratively improved approximations to the Pareto frontier, i.e. the set of best solutions contained along a trade-off curve of …

    wvu Repository record for Faster Evolutionary Multi-Objective Optimization via GALE, the Geometric Active Learner (opens in a new tab)

  17. INVERSE IDENTIFICATION OF TRANSIENT THERMAL PROPERTIES AND HEAT SOURCES USING GENETIC ALGORITHMS

    … algorithms. Genetic algorithms are robust, stochastic search techniques which also admit the ability to search highly nonlinear problems. In this work, computational techniques are developed for the simultaneous inverse identification the internal heat generation and the thermal diffusivity …

    cornell Repository record for INVERSE IDENTIFICATION OF TRANSIENT THERMAL PROPERTIES AND HEAT SOURCES USING GENETIC ALGORITHMS (opens in a new tab)

  18. Some Aspects on Data Modelling

    … data sequence are commonly found in many research areas, such as finance, bioinformatics and text mining. In this dissertation, two problems regarding these two types of data: association rule mining from transaction data and structural change estimation in time-ordered sequence, are …

    york Repository record for Some Aspects on Data Modelling (opens in a new tab)

Page 1 of 7