搜索资源列表
稀疏矩阵计算器
- 用三元组表示稀疏矩阵,可以转置 加法，减法，乘法，求逆。- With three Yuan groups expressed the sparse matrix, may transpose the addition, the subtraction, the multiplication, asks to go against.
第二代小波变换的源代码
- 此程序用提升法实现第二代小波变换用的是非整数阶小波变换,采用时域实现,步骤先列后行-procedure used to upgrade Method second generation wavelet transform the non-integer-order wavelet transform, time domain realized, first out go backward steps
DigitRecog
- 用bp实现的数字识别程序，用到了经典的bp算法，可移植到其他应用程序中去-bp achieve with the digital identification procedures, the use of classical bp algorithm can be transplanted to other applications go
secondwavelet
- 此程序用提升法实现第二代小波变换 我用的是非整数阶小波变换 采用时域实现,步骤先列后行 正变换：分裂，预测，更新； 反变换：更新，预测，合并 只做一层（可以多层，而且每层的预测和更新方程不同）-procedure used to upgrade Method second generation wavelet transform I use a non-integer-order wavelet transform domain when used, the firs
LimitedLabyrinth
- labyrinth: you need to find the doable way to go to the destinaton.And then print out the path.-labyrinth: You need to find the doable way to go to the destinaton.And then print out the path.
xinli
- 某心理咨询公司有三个顾员，其编号为1~3，他们上班时间为每天的8~17点，请打出某天他们接待咨询的时间。-a psychological consulting company three LAB, the No. 1 ~ 3, They go to work every day for the 8 ~ 17:00, making Somewhere they receive counseling time.
yinxingweiqi5
- 著名的银星围棋软件，据说是目前人工智能最高的围棋类软件。-famous Silver Star Go software, artificial intelligence is reportedly the highest Go Software.
wugui
- 三维无规行走，能走得个方向概率相同 回避所有经过的路线-three-dimensional random walk, can go the same direction to avoid all probability after the line
2501425708
- 此程序用提升法实现第二代小波变换 ％％ 我用的是非整数阶小波变换 ％％ 采用时域实现,步骤先列后行 ％％ 正变换：分裂，预测，更新； ％％ 反变换：更新，预测，合并 ％％ 只做一层（可以多层，而且每层的预测和更新方程不同）-the procedure used to upgrade method is the second generation wavelet transform%% I use a non-integer-order wavelet transform%%
yuyinluruchengxu
- 语音录放范例及原代码希望楼主给我加些分，以后我会多传些好东西上去-voice recording and showing examples and source code, I hope to the Island, plus some hours later I would go to some good things - up
xiyangqishi
- 有多种方法喔!西洋棋中骑士的走法与象棋的马类似,只能横向二格,纵向一格或者横向一格,纵向两格(但是西洋棋棋子必须放在格子中),第1步有2种走法,第二步就有5种走法.今有5*5的棋盘,并将骑士的第一步放于左上角(0,0)的位置,试找出一个路径,使骑士在25步内把剩下的24个位置全部走完.输出结果时,将骑士的路径显示于的5*5的方格中,每一方格内显示出走到此方格内为第同步的数字. -are many ways! Chinese chess knight of the law and take a h
vivaldi-sim-Aug232006.tar
- 题描述的是一个旅行商要到几个城市去，每个城市必须去一次且仅能去一次，要求满足这样条件的最短路径。将本软件稍作扩展即可用于城市规划、公交车路径安排-that descr iption is a traveling salesman to several cities, each city must go to one and only one, satisfy requirements for the shortest path. This software can be used for som
1047IntegerInquiry
- HDOJ 1047 One of the first users of BIT s new supercomputer was Chip Diller. He extended his exploration of powers of 3 to go from 0 to 333 and he explored taking various sums of those numbers. ``This supercomputer is great, remarked Chip. ``I o
qichexiaoshou
- 这是一个关于汽车销售集团的网站，有空看看哈。-This is a group of car sales websites, go look at Kazakhstan.
ChineseChess
- 用c++ 开发的中国象棋，其中有网络版和单机版 ，但由于水平有下限，单机版做得很差，电脑智商较低，党调整到很难实几分钟 电脑才能走一步。其中参考了Pc gameing这本书，这本书讲得真好。-with the development of the Chinese chess, which is the network version and the single version, but a lower level. has done a poor job of a single compute
chenxu
- 已知北京、上海、广州、昆明和西安五城市航线里程如图。分别实现： 1）找到北京到昆明的最短路径。 2）找到北京到昆明，必须途径上海的路径。 3）找到北京到昆明，必须途径上海，但不能去广州的路径。 -known Beijing, Shanghai, Guangzhou, Kunming and Xi'an City route five mileage figure. Were achieved : 1) to Kunming to Beijing to find t
Uk363Setup
- Bo go viet nam! Go dc tieng viet
GO_detection
- 在高斯杂波条件下的平均单元选大恒虚警处理-GO-CFAR under gauss clutter
Board-box-to-go-horse-riding-knight
- 马踏棋盘++骑士走方格 马踏棋盘++骑士走方格 CPP文档-Board box to go horse riding knight
GO-CFAR
- 最大选择恒虚警检测——GO-CFAR检测器：包括对于无目标、仅有噪声的信号进行GO-CFAR检测的仿真，以及对于含目标、且在瑞利杂波背景下的GO算法仿真。一些程序主要是为了绘图，画出GO-CFAR检测过程中的信号波形以及检测门限对比图；而另一些程序是为了计算GO-CFAR检测过程中的检测概率和虚警概率。-GO-CFAR detectors: simulations of detection to signals with no target but noise only, as well as