Cargando…
Completion Probabilities and Parallel Restart Strategies under an Imposed Deadline
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 t...
| Autor principal: | |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Public Library of Science
2016
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5061357/ https://www.ncbi.nlm.nih.gov/pubmed/27732631 http://dx.doi.org/10.1371/journal.pone.0164605 |