搜索结果
找到约 1,333 项符合
K-BEST 的查询结果
matlab例程 New users and old of optimization in MATLAB will find useful tips and tricks in this document, as we
New users and old of optimization in MATLAB will find useful tips and tricks in this document, as well as examples one can use as templates for their own problems.
Use this tool by editing the file optimtips.m, then execute blocks of code in cell mode from the editor, or best, publish the file to H ...
数据结构 #if !defined(AFX_GAQUEEN_H__C26AE0A3_F9B4_426F_A324_B460CC7946CB__INCLUDED_) #define AFX_GAQUEEN_H_
#if !defined(AFX_GAQUEEN_H__C26AE0A3_F9B4_426F_A324_B460CC7946CB__INCLUDED_)
#define AFX_GAQUEEN_H__C26AE0A3_F9B4_426F_A324_B460CC7946CB__INCLUDED_
#if _MSC_VER > 1000
#pragma once
#endif // _MSC_VER > 1000
class CGAQueen
{
public:
CGAQueen(int nPopulation,int nIteration,float Mutation,int mChB ...
其他书籍 This paper examines the asymptotic (large sample) performance of a family of non-data aided feedfor
This paper examines the asymptotic (large sample) performance
of a family of non-data aided feedforward (NDA FF) nonlinear
least-squares (NLS) type carrier frequency estimators for burst-mode
phase shift keying (PSK) modulations transmitted through AWGN and
flat Ricean-fading channels. The asymptoti ...
Java编程 We have a group of N items (represented by integers from 1 to N), and we know that there is some tot
We have a group of N items (represented by integers from 1 to N), and we know that there is some total order defined for these items. You may assume that no two elements will be equal (for all a, b: a<b or b<a). However, it is expensive to compare two items. Your task is to make a number of comparis ...
数据结构 问题描述 序列Z=<B
问题描述
序列Z=<B，C，D，B>是序列X=<A，B，C，B，D，A，B>的子序列，相应的递增下标序列为<2，3，5，7>。
一般地，给定一个序列X=<x1,x2,…,xm>，则另一个序列Z=<z1,z2,…,zk>是X的子序列，是指存在一个严格递增的下标序列〈i1,i2,…,ik〉使得对于所有j=1,2,…,k使Z中第j个元素zj与X中第ij个元素相同。
给定2个序列X和 ...
matlab例程 关于混沌Kolmogorov熵的计算程序
关于混沌Kolmogorov熵的计算程序，在前人基础上自己编写的。已经用过很多混沌时间序列K熵的计算。
其他 * first open client.cpp and search for that USER_MSG_INTERCEPT(TeamInfo) over it u add this
* first open client.cpp and search for that USER_MSG_INTERCEPT(TeamInfo)
over it u add this
Code:
USER_MSG_INTERCEPT(Health)
{
BEGIN_READ(pbuf,iSize)
me.iHealth = READ_BYTE()
return USER_MSG_CALL(Health)
}
* then we search for int HookUserMsg (char *szMsgName, pfnUserMsgHook pfn)
a ...
文章/文档 给定一个n位正整数a
给定一个n位正整数a，去掉其中任意k<=n个数字后，剩下的数字按原次序排列成一个新的正整数。对于给定的n位正整数a和正整数k，设计一个算法找出剩下数字组成的新数最小的删数方案。