Abstract
In this paper, we study the influence of the constrained computational resources on the expected value of the algorithm outcome. In our case, time is the limited resource, that is, the search process can be interrupted in any moment by the user who requests the current best solution. Different characteristics of the user behavior are discussed and a method for evaluation of the expected value is proposed. One of the characteristics is selected for experimental analysis of the algorithm outcome. The expected values of a given search process outcome for different user characteristics are evaluated and compared. © 2013 Springer-Verlag Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
Trojanowski, K., & Janiszewski, M. (2013). Expected value of the optimization algorithm outcome. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7912 LNCS, pp. 245–253). https://doi.org/10.1007/978-3-642-38634-3_27
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
