✦ LIBER ✦

On using deterministic functions to reduce randomness in probabilistic algorithms

✍ Scribed by Miklos Santha

Book ID: 113383826
Publisher: Elsevier Science
Year: 1987
Tongue: English
Weight: 477 KB
Volume: 74
Category: Article
ISSN: 0890-5401
DOI: 10.1016/0890-5401(87)90023-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Using genetic algorithms to determine no

Using genetic algorithms to determine nonnegative monotone set functions for information fusion in environments with random perturbation

✍ Zhenyuan Wang; Kebin Xu; Jia Wang; George J. Klir 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 219 KB 👁 2 views

Due to some inherent interactions among diverse information sources, the classical weighted average method is not adequate for information fusion in many real problems. To describe the interactions, an intuitive and effective way is to use an appropriate nonadditive set function. Instead of the weig

Use of 3D-transient analytical solution

Use of 3D-transient analytical solution based on Green’s function to reduce computational time in inverse heat conduction problems

✍ Ana P. Fernandes; Priscila F.B. Sousa; Valerio L. Borges; Gilmar Guimaraes 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 467 KB