代码搜索：evaluate
找到约 3,619 项符合「evaluate」的源代码
代码结果 3,619
www.eeworm.com/read/140850/13059645
m evaluate.m
function K = evaluate(ker, x1, x2)
% EVALUATE
%
% Evaluate a linear kernel, for example
%
% K = evaluate(ker, x1, x2);
%
% where x1 and x2 are matrices containing input patterns, where ea
www.eeworm.com/read/326691/13122263
cpp evaluate.cpp
#include
#include
#include
#include
#include
#include
#include "evaluate.h"
CEvaluate:: CEvaluate()
{
#if 1
ReadInfo();
m_
www.eeworm.com/read/326691/13123539
h evaluate.h
#ifndef Evaluate_H_H
#define Evaluate_H_H
#include
#include
#include
#include
#include
#include"Parameter.h"
#include "BrowseDir.h"
static
www.eeworm.com/read/326017/13170313
role_evaluate
www.eeworm.com/read/240259/13228322
cpp evaluate.cpp
//计算后缀表达式值的文件Evaluate.cpp
const int SM=40;
#include"linearStack2.cpp"
float Evaluate(char* str)
//计算由str字符串所表示的后缀表达式的值,
//表达式要以'@'字符结束.
{LinStack S;//创建对象S
S.InitStack(SM);//初始化栈
istrstream
www.eeworm.com/read/137229/13337836
c evaluate.c
/*
* GENESIS Copyright (c) 1986, 1990 by John J. Grefenstette
* This program may be freely copied for educational
* and research purposes. All other rights reserved.
*
* file: evalua
www.eeworm.com/read/321696/13400806
m evaluate.m
function y=evaluate(X,edge) %X为一个状态变量，edge是边长度矩阵,本程序返回一个回路的真实长度
y=edge(X(length(X)),X(1)); %首尾相连边长
for i=1:length(X)-1 %回路中的每条边依次相加
y=y+edge(X(i),X(i+1));
end
www.eeworm.com/read/310200/13656093
cpp evaluate.cpp
//计算后缀表达式值的文件Evaluate.cpp
const int SM=40;
#include"linearStack2.cpp"
float Evaluate(char* str)
//计算由str字符串所表示的后缀表达式的值,
//表达式要以'@'字符结束.
{LinStack S;//创建对象S
S.InitStack(SM);//初始化栈
istrstream
www.eeworm.com/read/152019/5677758
cpp evaluate.cpp
#include
#include "Cdefines.h"
#include "Global.h"
#undef max
#undef min
#define max(a, b) (((a) > (b)) ? (a) : (b))
#define min(a, b) (((a) < (b)) ? (a) : (b))
#define TOLE
www.eeworm.com/read/142536/5764725
c evaluate.c
/**********
Copyright 1990 Regents of the University of California. All rights reserved.
Author: 1985 Wayne A. Christopher, U. C. Berkeley CAD Group
**********/
/*
* Convert a parse tree to a list