Ontology highlight
ABSTRACT:
SUBMITTER: Lorenz JH
PROVIDER: S-EPMC5061357 | biostudies-literature | 2016
REPOSITORIES: biostudies-literature
PloS one 20161012 10
Let A be any fixed cut-off restart algorithm running in parallel on multiple processors. If the algorithm is only allowed to run for up to time D, then it is no longer guaranteed that a result can be found. In this case, the probability of finding a solution within the time D becomes a measure for the quality of the algorithm. In this paper we address this issue and provide upper and lower bounds for the probability of A finding a solution before a deadline passes under varying assumptions. We a ...[more]