✦ LIBER ✦

The use of tail inequalities on the probable computational time of randomized search heuristics

✍ Scribed by Dong Zhou; Dan Luo; Ruqian Lu; Zhangang Han

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fitness levels with tail bounds for the

✍ Witt, Carsten 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 197 KB

On the Optimization of Monotone Polynomi

✍ WEGENER, INGO; WITT, CARSTEN 📂 Article 📅 2005 🏛 Cambridge University Press 🌐 English ⚖ 193 KB

On the Lower Tail Probabilities of Some

✍ Frank Aurzada 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 363 KB

On the relation between the tail probabi

✍ J.L. Geluk 📂 Article 📅 1984 🏛 Elsevier Science ⚖ 197 KB

On the time development of the excitatio

✍ E. Majerníková 📂 Article 📅 1971 🏛 Elsevier Science ⚖ 195 KB

Upper Bounds on the Moments and Probabil

✍ G. Bennett 📂 Article 📅 1965 🏛 Oxford University Press 🌐 English ⚖ 905 KB