threadpool is a cross-platform C++ thread pool library
标签: cross-platform threadpool library thread
上传时间: 2015-07-12
上传用户:lz4v4
A program to find frequent molecular substructures and discriminative fragments in a database of molecule descriptions. The algorithm is based on the Eclat algorithm for frequent item set mining.
标签: discriminative substructures fragments molecular
上传时间: 2014-01-20
上传用户:龙飞艇
A program to demonstrate the optimization process of particle swarm optimization. A two-dimensional objective function is visualized by level of grey: the lighter the color, the higher the function value. The particles are shown as red circles, their trajectory as red lines.
标签: optimization two-dimensional demonstrate particle
上传时间: 2013-12-22
上传用户:Andy123456
A program to demonstrate the optimization process of ant colony optimization for the traveling saleman problem (TSP). The cities are shown as red circles, the pheromone on the connections between them (fully connected graph) by gray lines. The darker the grey, the more pheromone is currently on the edge. During the optimization, the currently best found tour is drawn in red. To run the optimization, first create a random TSP, then create an ant colony, and finally run the optimization.
标签: optimization demonstrate the traveling
上传时间: 2015-07-12
上传用户:偷心的海盗
A program to find frequent itemsets (also closed and maximal) with the eclat algorithm ,which carries out a depth first search on the subset lattice and determines the support of itemsets by intersecting transaction lists.
标签: algorithm frequent itemsets program
上传时间: 2013-12-27
上传用户:ouyangtongze
Programs to induce a naive possibilistic classifier (a possibilistic analog of the naive Bayes classifier) and to classify new data with an induced naive possibilistic classifier.
标签: possibilistic naive classifier Programs
上传时间: 2015-07-12
上传用户:虫虫虫虫虫虫
This OpenNL, a library to easily construct and solve sparse linear systems. * OpenNL is supplied with a set of built-in iterative solvers (Conjugate gradient,BICGSTAB, GMRes) and preconditioners (Jacobi, SSOR). * OpenNL can also use other solvers (SuperLU 3.0 is supported as an OpenNL extension,MUMPS will be supported in a future version)
标签: OpenNL construct supplied library
上传时间: 2014-01-07
上传用户:semi1981
本程序直接摘自文献: % S. K. Mitra. Digital Signal Processing: A Computer-Based Approach. Second Edition, % McGraw-Hill,2001 清华大学出版社,2001
标签: S. K. Computer-Based Processing
上传时间: 2014-12-02
上传用户:佳期如梦
Computes estimates for the number of forests of a graph, input as a 0-1 incidence matrix. Notes: Compile in C++, "g++ -o span_forest span_forest.c". The program does not demand that the matrix is symmetric with 0 diagonal, but uses only the upper triangular part.
标签: estimates incidence Computes forests
上传时间: 2013-12-26
上传用户:com1com2
Computes the permanent of a nonnegative integer matrix. Notes: Compile in C++, "g++ -o permanent permanent.c".
标签: permanent nonnegative Computes Compile
上传时间: 2013-12-23
上传用户:zhangyi99104144