Speed of convergence as a function of given accuracy for random search methods

1993 ◽  
Vol 33 (1) ◽  
pp. 89-108 ◽  
Author(s):  
V. V. Nekrutkin ◽  
A. S. Tikhomirov
Keyword(s):  
Random Search ◽  
Speed Of Convergence ◽  
Search Methods

Random Search Methods

2010 ◽  
pp. 55-66 ◽  
Author(s):  
William W. Tipton ◽  
Richard G. Hennig
Keyword(s):  
Random Search ◽  
Search Methods

A note on continuous search algorithms

1987 ◽  
Vol 24 (1) ◽  
pp. 277-280
Author(s):  
L. E. Garey ◽  
R. D. Gupta
Keyword(s):  
Random Search ◽  
Search Algorithms ◽  
Search Methods ◽  
Average Complexity

Continuous random search methods with an average complexity given by O(log(1/ε)) for ε → 0 where ε is a given accuracy were presented in a recent paper. In this article an example of an O(log log(1/ε)) method is presented and illustrated.

Random Search Methods

2006 ◽  
pp. 2175-2180
Author(s):  
H. Edwin Romeijn
Keyword(s):  
Random Search ◽  
Search Methods

An Agent-Based Approach to Synthesizing Structures

2015 ◽  
Author(s):  
Robin Kiff ◽  
Matthew Campbell
Keyword(s):  
Random Search ◽  
New Method ◽  
Hill Climbing ◽  
Automated Synthesis ◽  
Search Methods ◽  
Agent Based ◽  
Physics Simulation

This paper discusses a new method for the automated synthesis of structures. By creating a framework to implement the synthesis, several methods are compared for the application of building tall self-supporting towers. These towers are evaluated in a physics simulation and comprised of multiple nodes and connections. In this paper, a new agent-based method is compared to existing search methods including random search, A*, and Hill-Climbing search. With the agents making local changes to nodes in the tower, the method achieves better results with less time and memory.

Sign in / Sign up

Export Citation Format

Share Document