搜索资源列表
MQAM
- 摘要本文首先分析了自适应调制的原理, 它以频谱效率最高为准则, 在恒定功率约束条件下对接收信噪 比优化来选择不同调制阶数。然后引入时变多径信道模型, 通过仿真给出了自适应在此信道条件下的性能, 并分析 了信道估计误差对其性能的影响。 关键词自适应调制, 调制, 时变信道-Abstract This paper first analyzes the principle of adaptive modulation, spectral efficiency it up to standa
MyLog
- 日志输出程序，自定义日志函数 无参数个数限制函数的实现， 可控制日志输出级别， 封装良好，-log programme, realization of no parameters constraint function.
46
- The purpose of methodology is to suggest a list of commercially available system devices, the optimal number and type of units ensuring that the 25-year round total system cost is minimized subject to the constraint that the load energy requirements
2
- 对约束长度为9的viterbi硬判决进行测试-On the constraint length viterbi hard decision for the 9 test
Artificial_Intelligence
- --books which provide a theoretical basis for logic programming --books which describe how to write programs in Prolog (sometimes even in particular Prolog systems) --books which describe alternative logic programming languages like constrain
Interior-point-method-
- 内点法首先要在可行域求可行的初始点，这当约束增多时，往往是困难的，而外点法则不需要。-Interior point method in the feasible region must first find an initial feasible point, which increases when the time constraint is often difficult, outer point of law does not require.
matlab-optimaiztion
- 非线性不确定优化程序，约束函数也为非线性-Nonlinear uncertain optimization program, constraint function for the nonlinear
l1_soc_mljsq_joint
- 一种求解信号DOA的方法。该方法首先将DOA的估计转化为MMV问题，然后采用联合稀疏约束将其转化为带稀疏约束问题的求解。-A method of solving signal DOA. Firstly, the DOA estimates into MMV problem then will be transformed into the solving of the problems with sparse constraint joint sparse constraints.
lagrange
- 求解约束最优化问题，一种途径是在可行域内寻找使目标函数值下降的迭代点列，但是这类方法对于带非线性约束的最优化问题求解效果一般都不理想。因此我们利用另一种途径，即利用问题的目标函数和约束函数构造新的目标函数——罚函数，把约束最优化问题转化为相应的罚函数的无约束最优化问题来求解实际问题。-lagrange constraint multiplier method for the minimum
backtrack
- Constraint satisfaction problem with backtracking
AntSolver
- 在linux下C写的蚁群算法，用于解决约束条件下的VRP、TSP问题，效果发很好。-AntSolver is a program for solving constraint satisfaction problems with ACO
AntSolver2.0
- 在linux下C写的蚁群算法，用于解决约束条件下的VRP、TSP问题，效果发很好。-AntSolver2.0 is a program for solving constraint satisfaction problems with ACO，more better than AntSolver
EasyCP-0.1.22010
- 此源码用于进行约束求解， 可以解决很多约束满足问题， 例如N皇后问题。-This source is used for constraint solving, constraint satisfaction can solve many problems, such as N-Queens problem.
EM
- 用于求解带盒状约束的连续优化问题的类电磁机制算法(Electromagentism-like Mechanism Algorithm, EM)，该算法最早由Erasmus University的Birbil S. Ilker等人提出，是一种非常新颖且有效的智能算法。-The code realizes Electromagentism-like Mechanism Algorithm which is for solving continuous optimization problem wit
GA-with-Constraint
- appling GA to find optimum solution when we have constraints.
code
- EEOTS algorithm In this paper We merge two unconnected concepts (i) Channel coding can be used to conserve energy by transmitting at reduced power levels over longer durations. (ii) Electro-chemical mechanisms in batteries allow them to recover
ACO
- Ant Colony Algorithm for Non Constraint Optimization Problem
2
- 提升复杂系统的定量决策支持，将成本作为独立变量（CAIV）寻求“最佳”点设计，是一个约束的非线性优化问题，其目标函数是最优有效性度量（MOE）表示，由基于性能的成本模型、二阶约束MOEs、系统性能指标的界限（MOPs）构成。算法采用的是同时扰动随机逼近方法（SPSA）。附件中是二阶约束MOEs模型的仿真程序。附：仿真流程图-Ascend the quantitative decision support of complex systems, will cost as an independen
scheduling-resource-constraint
- This GAMS code is developed for multi mode resource constraint project in segmented activities. this code returns the exact solution for the problem which is NP-Hard and should be solved by another algorithms such as meta heuristics.
NEXYS4.UCF
- constraint for nexys4