资源列表
aiyinsitan
- 原题为： 1．有5栋5种颜色的房子 2．每一位房子的主人国籍都不同 3．这五个人每人只喝一个牌子的饮料，只抽一个牌子的香烟，只养一种宠物 4．没有人有相同的宠物，抽相同牌子的烟，喝相同牌子的饮料 已知条件： 1．英国人住在红房子里 2．瑞典人养了一条狗 3．丹麦人喝茶 4．绿房子在白房子的左边 5．绿房子主人喝咖啡 6．抽pallmall烟的人养了一只鸟 7．黄房子主人抽dunhill烟 8．住在中间房子的人喝牛奶
VCSparseMatrix
- 通过输入矩阵的行数,列数,元素来建立稀疏矩阵的源程序-input matrix by the number of rows, columns, element to establish the source of sparse matrix
Gcc+mmc
- under Gcc compiler，sd card and mmc card basic functions-under may refer compiler, sd card and basic functions mmc card
qiugensuanfa
- 求根算法系列小结,学习数值分析的可以来看看。-rooting algorithm series summary of the study and numerical analysis can look at.
dsTM
- 该程序是作者编写的程序，实现了图和树中的部分算法。-that the procedure was prepared by the author of procedures, a map and part of the tree algorithm.
floyd_warshall
- 用C语言实现最短路径算法中的Floyd-Warshall算法，这个算法可以用来解决信号处理中的一些问题。floyd_warshall.c是源程序；distance_2.txt文件存放图中各点之间的距离，以99999表示无穷大；floyd.txt文件是输出文件，其中存放各轮得到的输出矩阵，以及最后得到的各点间最短距离，如果有负回路则返回FALSE。-C language shortest path algorithm of Floyd-Warshall algorithm, The algorit
downlo1ad
- 基于模板的圆检测算法,很好的程序,看了都说不错-based on the template circle detection algorithms, good procedures, said good read
alvulv
- 该代码实现了A率和mu率PCM算法，有详细的注释说明，-the code achieved A rate and the rate of PCM mu algorithm, a detailed explanatory notes
bf-C++sourc
- Bayesian Filter.贝叶斯（Bayesian）滤波器的C++类库。包括卡尔曼滤波（kalman filter）、粒子滤波(particle filter)等。-Bayesian Filter. Bayesian (Bayesian) filters C Class. Including Kalman filter (Kalman filter). particle filter (particle filter).
moss
- A program to find frequent molecular substructures and discriminative fragments in a database of molecule descr iptions. The algorithm is based on the Eclat algorithm for frequent item set mining.-A program to find frequent molecular (subst ructures
psopt
- 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
acopt
- 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