An Account of Self-Organizing Systems
From MaRDI portal
Publication:4116066
DOI10.1137/0205050zbMath0346.68026OpenAlexW2048726309MaRDI QIDQ4116066
Publication date: 1976
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0205050
Analysis of algorithms and problem complexity (68Q25) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20)
Related Items (12)
The move-to-partner rule for self-organizing task allocation on a linear array ⋮ Comparison of subdominant eigenvalues of some linear search schemes ⋮ Off-line algorithms for the list update problem ⋮ Self-organizing sequential search and Hilbert's inequalities ⋮ An exact formula for the move-to-front rule for self-organizing lists ⋮ A generalized counter scheme ⋮ Stochastic rearrangement rules for self-organizing data structures ⋮ Unnamed Item ⋮ Self-organizing doubly linked lists† ⋮ [https://portal.mardi4nfdi.de/wiki/Publication:3908273 R�currence positive des librairies mixtes] ⋮ MOVE-FORWARD RULES AND f-SWAP RULES APPLIED TO A COMMUNICATION PROBLEM ⋮ Randomized competitive algorithms for the list update problem
This page was built for publication: An Account of Self-Organizing Systems
