玩刺猬（NIST的并行计算库）。
Playing with hedgehog (NIST s library for parallel computing). (2024-04-08, C++, 0KB, 下载0次)
斯坦福CS1492023年秋季并行计算作业
Stanford CS149, Fall 2023 PARALLEL COMPUTING Assignments (2024-03-31, C++, 0KB, 下载0次)
斯坦福大学使用MPI、openMP和CUDA进行CME 213-并行计算的课堂作业和期末项目。
Class work and final project for CME 213 - Parallel Computing at Stanford University using MPI, openMP and CUDA. (2024-02-29, C++, 0KB, 下载0次)
斯坦福CS1492023年秋季并行计算编程作业
Programming assignments for Stanford CS149, Fall 2023 PARALLEL COMPUTING (2024-01-06, C++, 0KB, 下载0次)
我在斯坦福大学为CME 213（使用OpenMP、MPI和CUDA的并行计算）工作。，
My work for CME 213 (Parallel Computing with OpenMP, MPI, and CUDA) at Stanford., (2018-06-11, C++, 0KB, 下载0次)
斯坦福cs149并行计算课程作业和注释：
coursework & notes for stanford cs149 Parallel Computing :
子集树回溯法 试设计一个用回溯法搜索子集空间树的函数。该函数的参数包括结点可行性判定函数和上界函数等必要的函数，并将此函数用于解装载问题。
装载问题描述如下：有一批共n个集装箱要装上艘载重量为c的轮船，其中集装箱i的重量为wi。找出一种最优装载方案，将轮船尽可能装满，即在装载体积不受限制的情况下，将尽可能重的集装箱装上轮船。
A subset of the trial design of a backtracking tree with backtracking search a subset of the space tree function. The function of the parameters include the node to determine the feasibility of function and the upper bound of the function and other necessary functions, and this function is used to load solution of the problem. Loading Problem described as follows: there is a group of n containers loaded onto ships to load ships for the c, in which the weight of the container i is wi. Find an optimal load programs, filled with ships as far as possible, that the volume loading unrestricted case, as far as possible re-loaded onto the container ship. (2009-12-31, C++, 1KB, 下载16次)