竹子价值的设计开发_胡敏君

矩阵计算基础算法，matlab源代码包括方程组直接法和迭代法以及特征值求解(Matrix Computing Basic Algorithms, Matlab Source Code)

说明：  海思16av200平台的imx385驱动源码，亲测有效(The imx385 driver source code of Hisilicon 16av200 platform, which is effective for personal test)

说明：  利用geatpy库是实现多目标优化， 基于改进NSGA-Ⅱ算法求解多目标优化问题的进化算法模板，传统NSGA-Ⅱ算法的帕累托最优解来只源于当代种群个体，这样难以高效地获取更多的帕累托最优解，同时难以把种群大小控制在合适的范围内，改进的NSGA2整体上沿用传统的NSGA-Ⅱ算法，不同的是，该算法通过维护一个全局帕累托最优集来实现帕累托前沿的搜索，故并不需要保证种群所有个体都是非支配的。(Using geatpy library to realize multi-objective optimization)

说明：  shixianleidafangzhecsssd(shixianleidafangzhedsss)

说明：  layui会员中心模版 包含注册 登陆 会员首页 个人中心页等等(Layui membership center template includes registered members homepage, personal center page, etc.)

scanned Babetta 210 service manual

用次梯度方法求解拉格朗日对偶问题的例子。。。。。。(Solve the optimal problem)

说明：  在具有至少十五个节点的网络中模拟洪泛路由。每个数据包应包含一个计数器（n = 10），该计数器在每一跳上递减。(Simulate flood routing in a network with at least fifteen nodes. Each packet should contain a counter (n=10) that is decremented on each hop. When the counter gets to zero, the packet is discarded. Time is discrete, and each link can handle only one packet per time interval (i.e. only one packet in total may traverse the link in either direction). Nodes should include a buffer to queue any additional packets. Present your results in terms of the number of duplicate packets produced, and the congestion at each node, and suggest a possible solution for reducing this problem.)

Delphi realization of well-known points game. Compiles with Delphi 7. Demonstrates simple depth search with some heuristics in estimate function.

pid 模块化化得编程，是增量式的参数,是很基础的东西(pid)