𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On a method of random search

✍ Scribed by Yu.M. Kaniovskii

Publisher
Elsevier Science
Year
1981
Weight
251 KB
Volume
21
Category
Article
ISSN
0041-5553

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Performance of SuSi: A method for genera
Performance of SuSi: A method for generating atomistic models of amorphous polymers based on a random search of energy minima
✍ David CurcΓ³; Carlos AlemΓ‘n πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 175 KB πŸ‘ 1 views

The performance of a recently developed method to generate representative atomistic models of amorphous polymers has been investigated. This method, which is denoted SuSi, can be defined as a random generator of energy minima. The effects produced by different parameters used to define the size of t

On a method for random graphs
On a method for random graphs
✍ Zbigniew Palka; Andrzej RucinΕ›ki; Joel Spencer πŸ“‚ Article πŸ“… 1986 πŸ› Elsevier Science 🌐 English βš– 293 KB

In this paper we examine a method for establishing an almost sure existence of a subgraph of a random graph with a given subgraph property. Since the method has been abused in the literature, we state some conditions under which it can be safely used. As an illustration we apply the method to induce

An Almost-Greedy Search on Random Binary
An Almost-Greedy Search on Random Binary Vectors and Random Graphs
✍ Avner Dor; Eitan Greenshtein πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 193 KB

A random vector is sampled from a general binary probability space and a search goes through the coordinates until a 1-coordinate is found. A search algorithm called ''almost greedy'' is shown to posses some novel characteristics. Its expectation is shown to be sharply bounded by four times the expe