✦ LIBER ✦

Parallel searching of multidimensional cubes

✍ Scribed by Miklos Santha; Umesh V. Vazirani

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 601 KB
Volume: 114
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(93)90381-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Single-Speed Molecular Dynamics of Hard

Single-Speed Molecular Dynamics of Hard Parallel Squares and Cubes

✍ W. G. Hoover; Carol G. Hoover; Marcus N. Bannerman 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 866 KB

Multidimensional binary search calculati

Multidimensional binary search calculation of the neuron model

✍ Naoya Chujo; Susumu Kuroyanagi; Shinji Doki; Shigeru Okuma 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 258 KB

Efficiency of Randomized Parallel Backtr

Efficiency of Randomized Parallel Backtrack Search

✍ Yanjun Zhang; A. Ortynski 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 128 KB

Multidimensional trees, range searching,

Multidimensional trees, range searching, and a correlation dimension algorithm of reduced complexity

✍ Stuart Bingham; Mark Kot 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 322 KB

Recent developments in parallelization o

Recent developments in parallelization of the multidimensional integration package DICE

✍ F. Yuasa; K. Tobimatsu; S. Kawabata 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 115 KB

In search of numerical consistency in pa

In search of numerical consistency in parallel programming

✍ Robert W. Robey; Jonathan M. Robey; Rob Aulwes 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 1013 KB

We present methods that can dramatically improve numerical consistency for parallel calculations across varying numbers of processors. By calculating global sums with enhanced precision techniques based on Kahan or Knuth summations, the consistency of the numerical results can be greatly improved wi