Search - c B - CodeBus

Search - c B - List

[MPI] huisufa01beibao DL : 0: 算法框架： a.. 问题的解空间：应用回溯法解问题时，首先应明确定义问题的解空间。问题的解空间应到少包含问题的一个（最优）解。 b. 回溯法的基本思想：确定了解空间的组织结构后，回溯法就从开始结点（根结点）出发，以深度优先的方式搜索整个解空间。这个开始结点就成为一个活结点，同时也成为当前的扩展结点。在当前的扩展结点处，搜索向纵深方向移至一个新结点。这个新结点就成为一个新的活结点，并成为当前扩展结点。如果在当前的扩展结点处不能再向纵深方向移动，则当前扩展结点就成为死结点。换句话说，这个结点不再是一个活结点。此时，应往回移动（回溯）至最近的一个活结点处，并使这个活结点成为当前的扩展结点。回溯法即以这种工作方式递归地在解空间中搜索，直至找到所要求的解或解空间中已没有活结点时为止。 (3). 运用回溯法解题通常包含以下三个步骤： a. 针对所给问题，定义问题的解空间； b. 确定易于搜索的解空间结构； c. 以深度优先的方式搜索解空间，并且在搜索过程中用剪枝函数避免无效搜索；-(3). The use of backtracking problem-solving usually contains the following three steps: a. In response to the problem, the definition of the solution space b. easy search to determine the structure of the solution space c. to depth-first search of the solution space, and pruning in the search process used to avoid invalid search function
Date : 2025-12-21 Size : 10kb User : 木枫
[MPI] jacobi DL : 0: Write an MPI program that solves a set of linear equations Ax = b with the 并行计算 Jacobi method. The root process reads the matrix A and the vector b from files. The file names have to be specified by the user as parameters.-Write an MPI program that solves a set of linear equations Ax = b with the Jacobi method. The root process reads the matrix A and the vector b from files. The file names have to be specified by the user as parameters.
Date : 2025-12-21 Size : 2kb User : 刘铭
[MPI] Sherwood DL : 0: 写一个Sherwood算法C(X)，与算法A(X)，B(X)，D(X)比较，给出实验结果。-Write a the Sherwood algorithm of C (X), with the algorithm A (X), B (X), D (X), experimental results are presented.
Date : 2025-12-21 Size : 282kb User : zhouqi
[MPI] templates.tar DL : 0: This program is designed to perform matrix matrix multiplication A x B = C, where A is an lxm matrix, B is a m x n matrix and C is a l x n matrix. The program is designed to be a template serial program that can be expanded into a parallel multiprocess and/or a multi-threaded program. -This program is designed to perform matrix matrix multiplication A x B = C, where A is an lxm matrix, B is a m x n matrix and C is a l x n matrix. The program is designed to be a template serial program that can be expanded into a parallel multiprocess and/or a multi-threaded program.
Date : 2025-12-21 Size : 1kb User : abed81
[MPI] reverseArray_singleblock DL : 0: 反向阵列(单块)-- 给定指针d_a中的输入数组{a0，a1，...，an-1}，将反向数组{an-1，an-2，...，a0}存储在指针d_b中 A: 从“reverseArray_singleblock”模板开始 B: 只有一个线程块启动，以反转一个大小的数组 N = numThreads = 256个元素 C: 第1部分（共1个）：所有你需要做的是实现内核的“reverseArrayBlock（）” D:每个线程将单个元件移动到相反的位置, 从d_a指标读取输入,在d_b指标中将输出存储在相反的位置(Reverse array (single block) - the input array {a0, A1,..., an-1} in the given pointer d_a, the reverse array {an-1, An-2,..., a0}, stored in the pointer d_b A: starts with the "reverseArray_singleblock" template B: has only one thread block to start to reverse an array of sizes N = numThreads = 256 elements C: first parts (1 altogether): all you need to do is implement the kernel's reverseArrayBlock ()" D: each thread moves a single element in the opposite position, reads input from the d_a index, and outputs the output in the opposite position in the d_b index)
Date : 2025-12-21 Size : 6kb User : p-yang
[MPI] Jacobi DL : 0: 线性方程组Jacobi迭代的并行计算程序，数据文件是A*x=b,A是4阶方阵的算例。(A*x=b, Jacobi, In Data.txt the Matrix is 4*4)
Date : 2025-12-21 Size : 2kb User : jonajosejota
[MPI] 矩阵向量 DL : 0: 带状划分的矩阵向量乘法。数据文件是40*40的算例。(The file is prepared for solving A*b, in the Date there is an example for A which is a 40*40 matrix)
Date : 2025-12-21 Size : 5kb User : jonajosejota