A novel algorithm named Adaptive Step Searching (ASS) is presented in the paper to solve the stochastic point location (SPL) problem. In the conventional method [1] for the SPL problem, the tradeoff between the convergence speed and accuracy is the main issue since the searching step of learning machine (LM) in the method is invariable during the entire searching. In that case, in ASS, LM adapts the step size to different situations during the searching. The convergence speed has been improved significantly with the same accuracy comparing to previous algorithms. © 2013 Springer-Verlag.
CITATION STYLE
Tao, T., Ge, H., Cai, G., & Li, S. (2013). Adaptive step searching for solving stochastic point location problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7995 LNCS, pp. 192–198). https://doi.org/10.1007/978-3-642-39479-9_23
Mendeley helps you to discover research relevant for your work.