๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Minimum number of steps for permutation in a bubble memory

โœ Scribed by K.M. Chung; F. Luccio; C.K. Wong


Book ID
113162171
Publisher
Elsevier Science
Year
1980
Tongue
English
Weight
389 KB
Volume
11
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


A Minimum on the Mean Number of Steps Ta
โœ H.ALLEN ORR ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 138 KB

I consider the adaptation of a DNA sequence when mutant fitnesses are drawn randomly from a probability distribution. I focus on "gradient" adaptation in which the population jumps to the best mutant sequence available at each substitution. Given a random starting point, I derive the distribution of

A sharp minimum on the mean number of st
โœ Noah A. Rosenberg ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 224 KB

It was recently conjectured by H.A. Orr that from a random initial point on a random fitness landscape of alphabetic sequences with one-mutation adjacency, chosen from a larger class of landscapes, no adaptive algorithm can arrive at a local optimum in fewer than on average e-1 steps. Here, using an

On the Number of Minimum Cuts in a Graph
โœ Chandran, L. Sunil; Ram, L. Shankar ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Society for Industrial and Applied Mathematics ๐ŸŒ English โš– 253 KB