搜索资源列表
全国交通咨询系统
- 一 题目 全国铁路交通咨询系统 二 需求分析 1.系统配制： 硬件：CPU：P4 1.6G 内存容量 256M 标准输入输出设备 软件：操作系统Windows xp 源程序调试工具VC6.0 可执行文件运行工具 DOS 5.0. 2.该系统有供用户选择的菜单和交互性。 3.建立一个全国铁路交通咨询系统，该系统具备自动查找任意两城市间铁路交通的最短路径和最少花费的功能。 三 设计概要 1.抽象数据类型 本程序运用了关于图这种数据
EditDistance
- C#的计算编辑距离的代码。可指定需要计算的区间以及操作代价函数。算法用动态规划方法实现。-C# Edit distance calculation code. Calculation required to specify the range and operating cost function. Algorithm using dynamic programming method.
hh
- 【 摘 要】 提出了一种基于负熵的快速不动点1 C A算法， 介绍了负熵的定义和如何将其用作代价函数度量混合信号的非 高斯性。 详细介绍了基于负熵的固定点准则以及简化算法。实验选取 3个非高斯向量作为信号源进行 Ma t l a b分离仿真， 结果显示 分离效果良好。-Abstract Based on the rapid Negentropy 1 CA fixed point algorithm, introduced the definition of negentropy an
asf1
- 单片计算机即单片微型计算机。（Single-Chip Microcomputer ）,是 集CPU ,RAM ,ROM , 定时，计数和多种接口于一体的微控制器。他体积小，成本低，功能强，广泛应用于智能产 品和工业自动化上。而51 单片机是各单片机中最为典型和最有代表性的一种。这次毕业设 计通过对它的学习，应用，从而达到学习、设计、开发软、硬的能力。 -Monolithic single-chip micro-computer that computer. (Single-Chi
chip_pathfinder
- 在谈判阻塞算法在电路设计中的应用，该算法不断迭代直到不存在被使用一次以上的路由资源。在每一次迭代过程中，先删除每个线网，然后根据最小化成本函数的原则重新布线-Choking algorithm in the negotiations in the circuit design, the iterative algorithms have been used until there is no more than one routing resources. In each iteration,
dianxin
- 模拟电信计费系统，实现计算话费的功能,可分时计费-Simulation of telecommunication billing system, to achieve the calculation of cost function
ACO
- 给定威胁源，利用蚁群算法规划出从指定起始点到目标点的满足代价函数最小的轨迹。-Given the threat source, using ant algorithm mapped out from the designated starting point to the target point trajectory to meet the minimum cost function.
assignment-regularization
- this source code written by matlab. Under machine learning feild. Get the data and calcuklate the cost function then regulize them. After that, plot them.
CMA_common
- 简单的CMA实现函数，包含两种代价函数，P=1和P=2的情况-CMA implement simple functions, comprising two cost function, P = 1 and P = case 2
qpso
- 量子粒子群算法，自己按需求编写代价函数。试过了，可以用，用于寻找极值很实用-Quantum particle swarm optimization, cost function to write their own request. Tried, can be used, very useful for finding extreme values
Solution-to-mathematical-modeling
- 中国大学生数学建模竞赛题解 jm96a - 捕鱼策略 jm96b - 节水洗衣机 jm96bfun - 节水洗衣机优化函数 jm97a - 零件参数设计 jm97afun - 零件参数函数 jm97aoptim - 零件参数设计优化函数 jm97b - 截断切割 jm97bcount - 截断切割枚举法 jm97brule - 截断切割优化准则 jm98a1 - 风险投资模型求解 jm98a2 - 风险投资模型讨论 j
mlclass-ex1
- 线性感知机，机器学习相关，基于matlab仿真-Files included in this exercise ex1.m- Octave scr ipt that will help step you through the exercise ex1 multi.m- Octave scr ipt for the later parts of the exercise ex1data1.txt- Dataset for linear regression with one vari
mlclass-ex2
- 逻辑回归，机器学习相关内容，内有说明，基于matlab仿真-ex2.m- Octave scr ipt that will help step you through the exercise ex2 reg.m- Octave scr ipt for the later parts of the exercise ex2data1.txt- Training set for the rst half of the exercise ex2data2.txt- Training s
mlclass-ex3
- 多分类学习及神经网络，机器学习相关，基于matlab计算-ex3.m- Octave scr ipt that will help step you through part 1 ex3 nn.m- Octave scr ipt that will help step you through part 2 ex3data1.mat- Training set of hand-written digits ex3weights.mat- Initial weights for the
mlclass-ex4
- 神经网络学习，基于matlab仿真，机器学习相关知识-ex4.m- Octave scr ipt that will help step you through the exercise ex4data1.mat- Training set of hand-written digits ex4weights.mat- Neural network parameters for exercise 4 submit.m- Submission scr ipt that sends you
DTSF
- 实现样本功能的距离变换—linear-time algorithms for solving a class of problems that involve transforming a cost function on a grid using spatial information.-linear-time algorithms for solving a class of problems that involve transforming a cost function on
RobustICA and Oscma
- 收集了Zarzoso相关的最优步长算法和RobustICA。最优步长算法（os-cma）基于有效的算法迭代技术，RobustICA基于归一化峰度对比功能，这是通过计算有效的迭代技术的优化。其中包含了原始的论文可以参考。(The optimal step-size constant modulus algorithm (OS-CMA) is based on a computationally efficient iterative technique to minimize the CM cos
dispatohprimaryclone
- Filter order fixed, the cost function and the relationship between the SNR when the signal-to-noise ratio is fixed
Constrained Optimization
- In mathematical optimization, constrained optimization (in some contexts called constraint optimization) is the process of optimizing an objective function with respect to some variables in the presence of constraints on those variables. The objectiv
大学生数学建模竞赛
- % jm96a - 捕鱼策略 % jm96b - 节水洗衣机 % jm96bfun - 节水洗衣机优化函数 % jm97a - 零件参数设计 % jm97afun - 零件参数函数 % jm97aoptim - 零件参数设计优化函数 % jm97b - 截断切割 % jm97bcount - 截断切割枚举法 % jm97brule - 截断切割优化准则 % jm98a1 - 风险投资模型求解 % jm98a2 - 风险投资模型讨论 % jm98a3 - 收益与风险非线性