-
karnaugh_inputs
KARNAUGH_INPUTS Boolean inputs for a Karnaugh map.
K = KARNAUGH_INPUTS(N) produces a table (array) of boolean inputs for a Karnaugh map.Each boolean input has N bits, and there are 2^N entries in the table.
- 2010-11-28 22:43:57下载
- 积分：1
-
[emuch.net]K-means
简易k-means聚类算法实例，针对二维数据，自带简易数据矩阵，分析结果有输出图像。(Simple k-means clustering algorithm example, for two-dimensional data, comes with simple data matrix, analysis results output image.)
- 2014-11-06 09:25:17下载
- 积分：1
-
minGS
用Goldstein法求解一维函数的极值
(By Goldstein method for solving one-dimensional function of the extreme)
- 2013-12-08 18:12:05下载
- 积分：1
-
code_decode
使用matlab中的GUI设计的译码器，配有适当的注释，适合初学者。(The GUI design using matlab decoder, with appropriate comments, suitable for beginners.)
- 2013-11-25 19:11:37下载
- 积分：1
-
CWT_Morlet
自己编写的，使用morlet复指数小波，进行连续小波变换的程序。能帮助理解小波变换的算法。(I have written using complex exponential morlet wavelets, continuous wavelet transform performed procedures. To help understand the algorithm based on wavelet transform.)
- 2015-04-04 22:17:07下载
- 积分：1
-
sPl1Pl21
论文 Least Squares Loss for Multi-class (task) Learning via the sparse group Lasso penalty 的算法源代码，是sparse+l1+lq,1的稀疏属性选择算法。( Least Squares Loss for Multi-class (task) Learning
via the sparse group Lasso penalty
Problem
min 1/2 || A x- y||^2+ lambda_1* |x|_1+ lambda_2*|x|_{q,1}
q=2, infty)
- 2015-10-08 14:12:39下载
- 积分：1
-
Bragggratt
Given the refractive index of the external network (semi-infinite Bragg) and the frequency in units of frequency Bragg, is the graph of the transmittance as a function of incident angle.
Fundamentals of Photonics-Second Edition
- 2009-10-16 00:12:25下载
- 积分：1
-
m_image
VC6.0与MATLAB2007a的接口程序 (VC6.0 and the interface program MATLAB2007a)
- 2009-05-25 15:49:48下载
- 积分：1
-
matlab1
这是在matlab编辑环境下开发的图形应用程序。(This is developed under matlab graphical editing environment applications.)
- 2010-01-02 10:03:07下载
- 积分：1
-
ACOR
Ant Colony Optimization (ACO) is an optimization metaheuristic based on the foraging behavior of ants. This metaheuristic was originally proposed to find good solutions to discrete combinatorial problems. Many extensions of the ACO heuristic for continuous domain have been proposed, but even those that claim close similarity with classical (discrete domain) ACO, like ACOR, do not use the heuristic information called visibility, commonly used in the original ACO algorithm. In this paper, we show the importance of the visibility in ACO, by proposing ACOℝ -V , a variant of ACOR that performs better in a number of benchmark functions.
- 2014-12-14 21:18:24下载
- 积分：1
