Shashanka Ubaru, Lior Horesh, et al.
Journal of Biomedical Informatics
For a family of maps (equation presented) we analyze the speed of convergence (including constants) to the globally attracting neutral fixed point p = 0. The study is motivated by a problem in the optimization of routing. The aim of this paper is twofold: (1) to extend the usage of dynamical systems to unexplored areas of algorithms and (2) to provide a toolbox for a precise analysis of the iterates near a non-degenerate neutral fixed point. © 2009 Instytut Matematyczny PAN.
Shashanka Ubaru, Lior Horesh, et al.
Journal of Biomedical Informatics
Elizabeth A. Sholler, Frederick M. Meyer, et al.
SPIE AeroSense 1997
Ziv Bar-Yossef, T.S. Jayram, et al.
Journal of Computer and System Sciences
Richard M. Karp, Raymond E. Miller
Journal of Computer and System Sciences