A cutoff time strategy based on the coupon collector’s problem
Throughout the course of an optimization run, the probability of yielding further improvement becomes smaller as the search proceeds, and eventually the search stagnates. Under such a state, letting the algorithm continue to run is a waste of time as there is little hope that subsequent improvement...
| Autor principal: | |
|---|---|
| Outros Autores: | , |
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2020
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/10400.1/13973 |
| País: | Portugal |
| Oai: | oai:sapientia.ualg.pt:10400.1/13973 |