The move-to-partner rule for self-organizing task allocation on a linear array
From MaRDI portal
(Redirected from Publication:4532399)
Recommendations
Cites work
- A generalized abel's partial summation formula and its application in self-organizing systems
- An Account of Self-Organizing Systems
- An exact formula for the move-to-front rule for self-organizing lists
- Birthday paradox, coupon collectors, caching algorithms and self- organizing search
- Convergence to stationary state for a Markov move-to-front scheme
- Dynamic load balancing by random matchings
- scientific article; zbMATH DE number 3678815 (Why is no real title available?)
- On the matrix occurring in a linear search problem
- Optimal parameters for load balancing using the diffusion method in \(k\)- ary \(n\)-cube network
- Quadratic assignment problems
- Random walks and hyperplane arrangements
- Self-Organizing Doubly-Linked Lists
- Self-organizing lists and independent references: A statistical synergy
- Stochastic reversibility in self-organizing systems
- Task assignment in Cayley interconnection topologies
Cited in
(2)
This page was built for publication: The move-to-partner rule for self-organizing task allocation on a linear array
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4532399)
