登录
首页 » C++ Builder » zishiingkongzhi

zishiingkongzhi

于 2006-06-01 发布 文件大小:169KB
0 221
下载积分: 1 下载次数: 30

代码说明:

  自适应控制的东西,看看吧好东西的,喜欢吧谢谢了(adaptive control of things, good things, let's see it, a thank you like it?)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • bsearch_c
    binary searching in the code.
    2013-07-25 19:58:35下载
    积分:1
  • Jendela
    This is a simple code for create window
    2014-01-10 15:22:27下载
    积分:1
  • MATLABGUI
    信号处理与分析,是基于gui的信号处理与分析,相关函数的应用。(Random signal analysis and Process)
    2013-12-25 15:27:36下载
    积分:1
  • Infineon_DS_BGT24MTR12_en_V3_2
    24G高集成度微波雷达芯片,一发二收,可组成阵列天线,数据处理后精度可达mm级(24 GHz transceiver MMIC with one transmitter and two receiver units • Fully integrated low phase noise VCO • Switchable prescaler with 1.5 GHz and 23 kHz output • On chip power and temperature sensors • Gilbert based homodyne quadrature receiver • Single ended RF input terminals)
    2015-06-20 05:40:03下载
    积分:1
  • fcest_bfsk
    该工程实现2fsk的载频估计,返回2fsk两个载频估计结果。(The project is estimated to achieve 2fsk carrier frequency, return 2fsk two carrier frequency estimation results.)
    2013-12-25 19:07:04下载
    积分:1
  • LEIDA
    常见激光雷达的重要原理 常见军用激光雷达的重要原理 激光(The principle of lidar)
    2011-12-22 14:19:00下载
    积分:1
  • RSdecod
    RS 码译码源程序,在Visual c++下可对比4元域上的RS码进行纠错译码.(RS decoder source, in Visual c contrast under four yuan domain of RS error correction code for decoding.)
    2007-04-13 11:21:10下载
    积分:1
  • MATLAB-code-for-TSP
    用GA算法和ACO算法在MATLAB上解决TSP问题,附有31个城市的坐标数据(Coordinate data with GA algorithms and ACO algorithm in MATLAB to solve the TSP with 31 cities)
    2012-11-10 23:20:37下载
    积分:1
  • 8
    MATLAB语言常用算法程序集,第8章 数值积分(MATLAB language commonly used algorithm for assembly, Chapter 8, numerical integration)
    2013-11-21 09:30:34下载
    积分:1
  • 0
    说明:  给定n种物品和一个背包,物品i的重量是Wi,价值是vi,被包容量是C,应该如何选择装入被包的物品,使得装入背包中物品的总价值最大?对于每种物品i,只有两种选择,装入或者不装入. 输入:第一行两个正整数n(物品数)和C(容量) 第二行n个正整数n,表示物品价值 第三行n个正整数n,表示物品重量 输出:第一行表示总价值 第二行n个数(0/1),0表示物品不装入,1表示装入 例如, 输入: 5 10 6 3 5 4 6 2 2 6 5 4 输出 15 1 1 0 0 1 (Species of a given n items and a backpack, the weight of item i is Wi, the value of vi, was packet capacity is C, should be how to choose a package of items to be loaded, the backpack load in the largest total value of goods? For each item i, there are only two options, loaded or not loaded. Input: the first line of the two positive integer n (the number of items) and C (capacity) of the second line of n positive integer n, that the value of the third line of n positive integer n, that the weight of output: the total value of the first line of the second line, said n number of (0/1), 0 that the items do not load, that load 1 for example, enter: 5,106,354,622 6 5 4 output 15 1 1 0 0 1)
    2009-07-01 23:07:01下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载