搜索结果
找到约 159 项符合
Min-Sum 的查询结果
人工智能/神经网络 这是一个将n个样本聚类到m个类别中 将n个样本在m个类里如何分配输出的遗传算法代码。 适应度：sum(i=1_110)sum(j=1_20)【xi-vj】~2
这是一个将n个样本聚类到m个类别中 将n个样本在m个类里如何分配输出的遗传算法代码。
适应度：sum(i=1_110)sum(j=1_20)【xi-vj】~2
人工智能/神经网络 This directory contains code implementing the K-means algorithm using min-max distance.
This directory contains code implementing the K-means algorithm using min-max distance.
汇编语言 Abstract A new intelligent milometer base on a microcontroller can count the sum. By taking full u
Abstract
A new intelligent milometer base on a microcontroller can count the sum. By taking full use of the processor 89s51 and E² PROM (AT24C02) and sensor of magnetism, it can count the sum of fully distance and the course of development.
企业管理 Relationship Between the Sum of Squared Difference (SSD) and Cross Correlation for Template Matchin
Relationship Between the Sum of Squared Difference (SSD)
and Cross Correlation for Template Matching
Konstantinos G. Derpanis
York University
kosta@cs.yorku.ca
Version 1.0
December 23, 2005
Linux/Unix编程 Introduce for sum system
Introduce for sum system
人工智能/神经网络 function [U,center,result,w,obj_fcn]= fenlei(data) [data_n,in_n] = size(data) m= 2 ％ Exponent fo
function [U,center,result,w,obj_fcn]= fenlei(data)
[data_n,in_n] = size(data)
m= 2 ％ Exponent for U
max_iter = 100 ％ Max. iteration
min_impro =1e-5 ％ Min. improvement
c=3
[center, U, obj_fcn] = fcm(data, c)
for i=1:max_iter
if F(U)>0.98
break
else
w_new=eye(in_n,in_n)
center1=sum(cent ...
编译器/解释器 编译原理--词法分析 功能： 输入：所给文法的源程序字符串 输出：二元组（syn,token或sum）构成的序列
编译原理--词法分析
功能：
输入：所给文法的源程序字符串
输出：二元组（syn,token或sum）构成的序列
VHDL/FPGA/Verilog verilog code 16-bit carry look-ahead adder output [15:0] sum // 相加總和 output carryout // 進位 input
verilog code
16-bit carry look-ahead adder
output [15:0] sum // 相加總和
output carryout // 進位
input [15:0] A_in // 輸入A
input [15:0] B_in // 輸入B
input carryin // 第一級進位 C0
STL int getDivisor(int iNum) { int i = 1 int sum = 0 if (0 == iNum) { return 1 } while
int getDivisor(int iNum)
{
int i = 1
int sum = 0
if (0 == iNum)
{
return 1
}
while (i <= iNum / 2)
{
if (0 == iNum ％ i)
{
sum++
}
i++
}
return (sum+1)
}
数值算法/人工智能 动态规划算法：Max-Min Tree Paritioning
动态规划算法：Max-Min Tree Paritioning