Internet Archive Search: subject:"parallel computing"

Search Results

Results: 1 through 6 of 6 (0.618 secs)
You searched for: subject:"parallel computing"

	CLUG Talk - 12 August 2008 - The Process Model of the Transputer - Andy Rabagliati CLUG Talk: The Process Model of the Transputer Speaker: Andy Rabagliati More CLUG Talks Keywords: CLUG; Transputer; Process Model; Concurrency; Parallel Computing Downloads: 20 Average rating: (0 review)
	LILUG, Parallel Computing & MPI by Brian Fix - dotCOMmie Recording of Long Island Linux User Group (lilug.org) talk on Parallel Computing & MPI by Brian Fix. Keywords: LILUG; LUG; Brian Fix; Fix; Super computing; parallel computing; MPI Downloads: 34 Average rating: (0 review)
	CLUG Talk 28 October 2008 - GPU Computing - John Stone CLUG Talk: GPU Computing Speaker: John Stone More CLUG Talks Keywords: CLUG; GPU Computing; Parallel computing; HPC; high performance computing; protein folding; vmd Downloads: 174 Average rating: (0 review)
	MIT 6.046J Introduction to Algorithms - MIT OpenCourseWare This course teaches techniques for the design and analysis of efficient algorithms, emphasizing methods useful in practice. Topics covered include: sorting; search trees, heaps, and hashing; divide-and-conquer; dynamic programming; amortized analysis; graph algorithms; shortest paths; network flow; computational geometry; number-theoretic algorithms; polynomial and matrix calculations; caching; and parallel computing. Keywords: algorithms, efficient algorithms, sorting, search trees, heaps, hashing, divide-and-conquer, dynamic programming, amortized analysis, graph algorithms, shortest paths, network flow, computational geometry, number-theoretic algorithms, polynomial and matrix calculations, caching, parallel computing Downloads: 21,387 Average rating: (0 review)
	MIT 6.046J / 18.410J Introduction to Algorithms (SMA 5503), Fall 2005 - MIT OpenCourseWare Keywords: algorithms, efficient algorithms, sorting, search trees, heaps, hashing, divide-and-conquer, dynamic programming, amortized analysis, graph algorithms, shortest paths, network flow, computational geometry, number-theoretic algorithms, polynomial and matrix calculations, caching, parallel computing Downloads: 31,567 Average rating: (0 review)
	MIT 6.046J / 18.410J Introduction to Algorithms (SMA 5503), Fall 2005 (2005); Real Media files - MIT OpenCourseWare This course teaches techniques for the design and analysis of efficient algorithms, emphasizing methods useful in practice. Topics covered include: sorting; search trees, heaps, and hashing; divide-and-conquer; dynamic programming; amortized analysis; graph algorithms; shortest paths; network flow; computational geometry; number-theoretic algorithms; polynomial and matrix calculations; caching; and parallel computing... Keywords: algorithms, efficient algorithms, sorting, search trees, heaps, hashing, divide-and-conquer, dynamic programming, amortized analysis, graph algorithms, shortest paths, network flow, computational geometry, number-theoretic algorithms, polynomial and matrix calculations, caching, parallel computing Downloads: 2,734 Average rating: (0 review)