搜索资源列表
lqx10002
- 最佳高度问题。 问题描述： 假设有n个任务由K个可并行工作的机器完成。完成任务i需要的时间为t(i)。试设计一个算法找出完成这n个任务的最佳调度，使得完成全部任务的时间最早。-best height of the problem. Problem descr iption : Suppose a mandate from the n-K parallel work can be completed machines. I need to complete the task for t
ParallelLBM
- Parallel LBM in C++ In which, as a counterpoint to abstract virtual generic templated meta-programming, we present a concrete code to simulate on precisely two computational nodes using a 1D lattice Boltzmann model with omega = 1 the heating of one
ParallelMethodsOfDataSorting
- Parallel Sorting Methods (Message Passing Protocol based) Lab version: tested and examples to use By MonteCristo (H.U.T)
46131_Thining
- 二值影像之骨架化程式(Thining) 程式是實作T.Y Zhang and C.Y Sueny在1984所提出的 "A fast parallel Algorithm for thinning Digital Patterns"的演算法-Binary image of the skeleton program (Thining) program is the implementation TY Zhang and CY Sueny made in 1984, " A fa
myperT4
- constructive role of noise in signal detection from parallel arrays of quantizers.-A noisy input signal is observed by means of a parallel array of one-bit threshold quantizers,in which all the quantizer outputs are added to produce the array output.