-
QR-Generator
this is the qr code gen code
- 2015-03-22 02:13:05下载
- 积分：1
-
wer
就是一件小小的源码，关于matlab的
(something)
- 2009-04-21 20:36:11下载
- 积分：1
-
201019143958120804
matlab 算法 (matlab algorithm)
- 2010-05-13 09:43:54下载
- 积分：1
-
api-zliao
API的英文全称(ApplicationProgrammingInterface)，WIN32API也就是MicrosoftWindows32位平台的应用程序编程接口。(API s English name (ApplicationProgrammingInterface), WIN32API is MicrosoftWindows32 platform application programming interface.)
- 2014-10-10 17:43:50下载
- 积分：1
-
1-aplikasi-penjualan
Yeah I actually fixed it by moving a bunch of stuff to onResume(). There are also a number of other bugs I found in this code posted here (which was based on even buggier code) that I will post as soon as I get them all fixed. The first one that comes to mind is that in the try block it needs to check if c is null. Another one is that there is no error handling for a source going down midstream
- 2015-03-27 00:50:12下载
- 积分：1
-
powerflow-input
针对C语言环境下的电力系统潮流计算过程中，负责数据输入的子程序。(Power flow calculation for the C language environment in the process, is responsible for routine data entry.)
- 2013-11-26 15:50:43下载
- 积分：1
-
1
说明： 介绍matlab和vc混编后独立运行程序(Introduce matlab and vc after running the program. Independent mix
)
- 2011-06-23 09:05:47下载
- 积分：1
-
CV_CPP
这个版本的代码，基于无边缘活动轮廓，即chan-vese模型，此代码中包含了C++版本和matlab版本(This version of the code, based on active contours without edges, that chan-vese model, this code contains C++ version and matlab version)
- 2015-11-16 11:54:41下载
- 积分：1
-
CR_pm
认知无线电功率控制算法中各认知用户最小发射功率的计算(Calculation of each cognitive user minimum transmit power in cognitive radio power control algorithm)
- 2012-05-04 11:06:21下载
- 积分：1
-
Recursive_integer_division
递归法求解整数划分。
整数划分，是指把一个正整数n写成如下形式：
n=m1+m2+…+mi （其中mi为正整数，并且1 <= mi <= n），则{m1,m2,...,mi}为n的一个划分。
如果{m1,m2,...,mi}中的最大值不超过m，即max(m1,m2,...,mi)<=m，则称它属于n的一个m划分。这里我们记n的m划分的个数为f(n,m) (Recursive method integer division. Integer division, refers to a positive integer n written as follows: n = m1+m2+ ...+mi (where mi is a positive integer, and 1 < = mi < = n), then {m1, m2, ..., mi} is a division of n. If {m1, m2, ..., mi} does not exceed the maximum value of m, i.e., max (m1, m2, ..., mi) < = m, m n is said that it belongs to a division. Where m is the number of division n our mind is f (n, m) )
- 2014-02-06 14:21:38下载
- 积分：1
|
联系客服（QQ：3324461878）
