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 198 for “"random search"”.
-
Random Search Plus: A more effective random search for machine learning hyperparameters optimization
… optimization. The popular methods include grid search, random search, manual search, Bayesian optimization, population-based optimization, etc. Random search occupies less computations than the grid search, but at the same time there is a penalty for accuracy. However, this paper proposes a more …
-
Comparison of three random search methods
Three recent random search algorithms are compared on the basis of efficiency, and on the basis of sensitivity to noise, scaling and the number of variables. A general discussion of random search methods points out their advantages and disadvantages in relation to deterministic methods. A new …
-
Optimized relative step size random search
… for the minimization of a function by a random search is presented. The search is a modification of the Optimum Step Size Random Search of Schumer and Steiglitz to include reversals. A theory for updating the step size is presented upon which an implementation of a search algorithm …
-
Random Search Algorithms for Optimal Control
… assumption. In this case one has to resort to random search (Monte Carlo) algorithms. This thesis presents random search algorithms that fall into two categories. The first category is locally optimal sampling based trajectory optimization methods. The second one is real-time capable Monte …
-
Parallelization of random search global optimization algorithms /
… problems are relevant in various fields of research and industry, such as chemistry, biology, biomedicine, operational research, etc. Normally it is easier to solve optimization problems having some specific properties of objective function such as linearity, convexity, differentiability, etc. …
-
Adaptive Random Search Methods for Simulation Optimization
… simulation procedure. We develop adaptive random search methods for solving such simulation optimization problems. The methods are adaptive in the sense that they use information gathered during previous iterations to decide how simulation effort is expended in the current iteration. We …
-
Evaluation of efficiency of random search optimization algorithms /
An application is created for quick and no coding knowledge required analysis of optimization problems. Applications building process and data formatting is explained. An overview of two advanced statistical features are explained and involved. Some evolutionary algorithms are compared to showcase …
-
Effects of uniform target density on random search
… Pacific (COMSUBAC) of detection rates for a random search model. COMSUBPAC's study included that the probability of nondetection to time t, PND (t), was not of the form exp (-y t), as believed by many. The target motion model used for that study was a new and interesting model, therefore this …
-
Random search of AND-OR graphs representing finite-state models
… into a compact AND-OR graph. We use an abductive random search scheme to extract, from the AND-OR graph, information about the execution of the program represented by the original finite-state model.;We use the search to measure testability. For AND-OR graphs representing highly testable programs, …
-
Application of Random Search Techniques to Land Use Plan Design
… are examined. A simple procedure based on a random search technique is next evaluated in an effort to improve model operation. The validity of the random technique is established through a series of small scale controlled experiments with hypothetical areas. The controlled experiment …
-
Random search models of foraging behavior: Theory, simulation, and observation
… to find food. These movement patterns, known as search strategies, have recently be- come a focus of ecologists interested in identifying universal properties of optimal foraging behavior. In this dissertation, I describe three contributions to this field. First, I propose a way to extend …
-
Performance analysis of a random search algorithm for distributed autonomous mobile robots
This thesis presents a cooperative random search algorithm for distributed autonomous mobile robots. In particular, we are developing an algorithm that enables a team of homogeneous robots, without localisation capabilities and using limited communications, to search for targets in an unknown …
-
The application of random search theory to the detection of tactical ballistic missile launchers
The search for Tactical Ballistic Missile (TBM) launchers is modeled mathematically using the Random Search Model. Special provisions are made in the model to account for the fact that the launcher is not always exposed to detection by the searcher. The probability that the launcher is exposed to …
-
ON SOLVING MULTI-OBJECTIVE SIMULATION OPTIMIZATION BY OPTIMAL COMPUTING BUDGET ALLOCATION AND RANDOM SEARCH
… through optimal computing budget allocation and random search. First, three simulation budget allocation strategies with asymptotic optimal guarantee are developed to tackle with multi-objective Ranking and Selection from the perspective of large deviation principle. Second, two globally …
-
Random search conformational analysis of piperazine and piperadine analogs of GBR12909 : implicit aqueous solvation effects
… Local minima on the PES's were found by the Random Search algorithm using the Sybyl molecular modeling package from Tripos, Inc., and an implicit solvent model. Two force-field/charge models were employed in the analysis: the Tripos force field with Gasteiger-Huckel charges and the MMFF94 …
-
Approximating the Poisson Scan and (A-0) Acoustic Detection model with a random search formula
… the author develops a MATLAB simulation of area search with acoustic sensors modeled by the Poisson Scan model and the Lambda-Sigma (A-0) model. Detection time results are compared to those given by the much simpler Random Search formula. Random Search was found to closely approximate the more …
-
SPEEDING-UP A RANDOM SEARCH FOR THE GLOBAL MINIMUM OF A NON-CONVEX, NON-SMOOTH OBJECTIVE FUNCTION
… methods are useful only locally – if at all. Random search methods offer a viable alternative, but their convergence properties are not well-studied. The present work adapts a proof by Baba et al. (1977) to establish asymptotic convergence for Monotonic Basin Hopping, a random search method …
Page 1 of 10