搜索资源列表
FPGA_constraints
- 这是关于FPGA时序约束的文档,属于入门级介绍。在逻辑设计尤其是高速设计时,时序约束是必不可少的!-This is the documentation on the FPGA timing constraints, are entry-level introduction. High-speed logic design, especially in the design, timing constraints is essential!
ESPPRC
- 带资源约束的最短路径算法实现,包括时间和负载两种约束-an exact algorith for the shortest path problem with resource constraints, which are time and load constraints.
fminsearchbnd
- Fminsearch不承认的约束限制。 不过简单的转换方法存在 转换成一个绑定的约束问题 无约束问题。 Fminsearchbnd用于酷似fminsearch, 除了边界应用到变量。 应用于国内的界限,利用 改造中的变量。 (二次型 单式,双罪恶界(十)。) 具有包容性的不平等的界限,它承认 边界值本身,但不准 在所有函数之外的范围评估。 请注意,fminsearchbnd允许用户准确地固定在某个给定值通过设置一个变量的确切
psooptimiton
- 粒子群求解无约束优化问题,包括基本粒子群算法,改进的粒子群算法,还有基于自然选择的粒子群算法和模拟退火的粒子群算法-Swarm for unconstrained optimization problems, including particle swarm algorithm, the improved particle swarm optimization, as well as natural selection based on PSO and simulated annealing p
dcx
- 用FR共轭梯度法求解无约束最优化问题(c++)-With the FR conjugate gradient method for solving unconstrained optimization problems
LINGO1
- 用于计算安全约束机组组合的lingo程序-Unit used to calculate the security constraints of the lingo program
sdafsearchbnd
- Fminsearch不承认的约束限制。 不过简单的转换方法存在 转换成一个绑定的约束问题 无约束问题。 Fminsearchbnd用于酷似fminsearch, 除了边界应用到变量。 应用于国内的界限,利用 改造中的变量。 (二次型 单式,双罪恶界(十)。) 具有包容性的不平等的界限,它承认 边界值本身,但不准 在所有函数之外的范围评估。 请注意,fminsearchbnd允许用户准确地固定在某个给定值通过
1163
- 最大流算法,差分约束系统, 最大流算法,差分约束系统, 最大流算法,差分约束系统,的代码实现-the algorithm of maxflow askfasfka alskdfja aldfjas askdjfa askdlfjad askdf askfj askdfj askfjaf
constrainedcircle
- 研究各种拟合圆的方法,提出了一个圆的代数距离表示法的系数约束条件,在此约束条件下讨论圆的几何特征参数的估计问题,并给出了特征参数在约束条件下的最小二乘估计.实例验证表明,文中算法比一般最小二乘法具有更高的拟合精度. -Various methods of fitting a circle, a circle is proposed algebraic representation of the coefficient of distance constraints, under the co
BLG-1.1.tar
- 用梯度的方法解决有边界约束和一个线性等式约束的优化问题-This directory contains the BLG code for solving an optimization problem with bound constraints and a single linear equality constraint using a gradient method.
BLG-1.1
- 用梯度的方法解决有边界约束和一个线性等式约束的优化问题-This directory contains the BLG code for solving an optimization problem with bound constraints and a single linear equality constraint using a gradient method.
e
- 秩约束多帧特征对应算法Rank constraint algorithm for multi-frame feature correspondence-Rank constraint algorithm for multi-frame feature correspondence
k-means
- 本文详细地介绍了k-means算法和一种改进的K-means算法,即基于成对约束的Cop-kmeans算法。该算法结合了Must-Link和Cannot-Link约束,数据对象在这两类约束的“监督”下进行划分。-This paper introduces the k-means algorithm and an improved K-means algorithm, which is based on pairwise constraints Cop-kmeans algorithm. The
nmfsc
- 稀疏约束的非负矩阵分解Non-negative Matrix Factorization with Sparseness Constraints-Non-negative Matrix Factorization with Sparseness Constraints
MIT_AI_lec_03
- 麻省理工的人工智能讲义第三章 约束满足问题 介绍了各种类型的约束满足问题-AI lecture-3 of MIT talking about Constraint Satisfaction Problems (CSPs):N-Queens problem;line labelings;Graph coloring;3-SAT; Model-based recognition etc.
19864062MatrixOper
- 对于协方差矩阵的一种计算方法,对于地震中的反演约束算法能起到很好的作用。-For a kind of covariance matrix calculation method
DFP
- 约束问题的DFP算法,关于牛顿法的一种改进-Constraints DFP algorithm, an improvement on Newton' s law
DCRCB
- 双约束波束形成算法,相比传统的鲁棒波束形成算法,加入了波矢量的范数约束,-Dual constraint beamforming algorithm
socp_beamforming
- 基于二阶锥约束的方向不变恒定束宽波束形成-Based on the direction of the same second-order cone constraint constant beamwidth beamforming
-Common-non-binding
- 最优化常用无约束方法,内有最速下降法,newton法,共轭梯度法,坐标轮换发等程序,程序均用C语言编写!-The most common unconstrained optimization methods, steepest descent method within, newton method, conjugate gradient method, coordinate rotation of hair and other procedures, procedures are writte