✦ LIBER ✦

Parallel Coarse Grain Computing of Boltzmann Machines

✍ Scribed by Julio Ortega; Ignacio Rojas; Antonio F. Diaz; Alberto Prieto

Book ID: 110278768
Publisher: Springer US
Year: 1998
Tongue: English
Weight: 262 KB
Volume: 7
Category: Article
ISSN: 1370-4621
DOI: 10.1023/a:1009689415274

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On Estimating Machine Dependency of Fine

On Estimating Machine Dependency of Fine– and Coarse–Grained Parallel Structural Computations

✍ W. J. Watkins; D. Kennedy; F. W. Williams 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 321 KB

Parallelizing image feature extraction o

Parallelizing image feature extraction on coarse-grain machines

✍ Yongwha Chung; Prasanna, V.K. 📂 Article 📅 1998 🏛 IEEE 🌐 English ⚖ 228 KB

String Search in Coarse-Grained Parallel

String Search in Coarse-Grained Parallel Computers

✍ Ferragina, P.; Luccio, F. 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 254 KB

The Complexity of Parallel Multisearch o

The Complexity of Parallel Multisearch on Coarse-Grained Machines

✍ Bäumker, A.; Dittrich, W.; Pietracaprina, A. 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 200 KB

Building Large Phylogenetic Trees on Coa

Building Large Phylogenetic Trees on Coarse-Grained Parallel Machines

✍ Thomas M. Keane; Andrew J. Page; Thomas J. Naughton; Simon A.A. Travers; James O 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 271 KB

Solving large FPT problems on coarse-gra

Solving large FPT problems on coarse-grained parallel machines

✍ James Cheetham; Frank Dehne; Andrew Rau-Chaplin; Ulrike Stege; Peter J. Taillon 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 208 KB

Fixed-parameter tractability (FPT) techniques have recently been successful in solving NP-complete problem instances of practical importance which were too large to be solved with previous methods. In this paper, we show how to enhance this approach through the addition of parallelism, thereby allow