کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4636273 | 1340721 | 2007 | 7 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A revised forward and backward heuristic for two-term multiple recursive random number generators
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات کاربردی
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
This paper is concerned with designing a full period two-term kth-order multiple recursive generator (MRG) with the objective of maximizing the spectral value. A new heuristic that combines a forward and backward method with random and best-improving is presented. We adopt a statistical analysis to compare the performance of the new heuristic to the random search method for the full period two-term MRGs of orders three and four. We also perform a single longer experiment with maximum allowed CPU 604Â 800Â s to compare the spectral value found using the new heuristic with the best of the previously published one. The results presented in this paper show that our method is indeed very effective with respect to the spectral value. Therefore, the new heuristic is a good way of obtaining an ideal two-term MRG of higher orders.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Mathematics and Computation - Volume 185, Issue 1, 1 February 2007, Pages 240-246
Journal: Applied Mathematics and Computation - Volume 185, Issue 1, 1 February 2007, Pages 240-246
نویسندگان
Ching-Jing Kung, Hui-Chin Tang,