代码搜索：initial
找到约 10,000 项符合「initial」的源代码
代码结果 10,000
www.eeworm.com/read/169682/9846260
l lex-fct_pddl.l
%{
#include "ipp.h"
#include "utilities.h"
/* default yywrap function - always treat EOF as an EOF */
#define fct_pddlwrap() 1
%}
a [Aa]
b [Bb]
c [Cc]
d [Dd]
e [Ee]
f [Ff]
g [Gg]
h [Hh]
i [I
www.eeworm.com/read/169682/9846287
l lex-ops_pddl.l
%{
#include "ipp.h"
#include "utilities.h"
/* default yywrap function - always treat EOF as an EOF */
#define ops_pddlwrap() 1
%}
a [Aa]
b [Bb]
c [Cc]
d [Dd]
e [Ee]
f [Ff]
g [Gg]
h [Hh]
i [Ii]
j
www.eeworm.com/read/365783/9847412
c menu4.c
#include
#include
#include
char *menu[] = {
"a - add new record",
"d - delete record",
"q - quit",
NULL,
};
int getchoice(char *greet, char *choices[
www.eeworm.com/read/169505/9853859
c retarget.c
//*----------------------------------------------------------------------------
//* ATMEL Microcontroller Software Support - ROUSSET -
//*-------------------------------------------------
www.eeworm.com/read/365237/9871301
c 18f_ad.c
//************************************************
//用18f6585写的5通道ad程序，2006-9-22调试通过
//************************************************
#include
#include
void Int_tmr0(void);
www.eeworm.com/read/168772/9897934
c retarget.c
//*----------------------------------------------------------------------------
//* ATMEL Microcontroller Software Support - ROUSSET -
//*-------------------------------------------------
www.eeworm.com/read/167363/9971181
m tec_test_function.m
function f=TEC_test_function(x,fun,VRmin,VRmax,gbias,norm_flag,shift_flag)
global orthm %best_f best_keep initial_flag
[ps,D]=size(x);
if norm_flag==1
x=VRmin(1,:)+(VRmax(1,:)-VRmin(1,:)).*x;
www.eeworm.com/read/362213/10012623
m recur.m
function y = recur(a,b,n,x,x0,y0);
%
% y = recur(a,b,n,x,x0,y0)
% solves for y[n] from:
% y[n] + a1*y[n-1] + a2*y[n-2]... + an*y[n-N]
% = b0*x[n] + b1*x[n-1] + ... + bm*x[n-M]
%
% a, b, n,
www.eeworm.com/read/362008/10023870
m hmm_forward.m
function [Pout, Alpha] = HMM_Forward(a, b, initial_state, V)
% Find the probability of a finite state in a Markov chain using the HMM forward algorithm
%
% Inputs:
% a - Transition probabili
www.eeworm.com/read/362008/10023894
m hmm_generate.m
function out = HMM_generate(a,b,initial,seq_len)
% Generate a Markov sequence
%
% Inputs:
% a - Transition probability matrix
% b - Output generator matrix
% initial - Initial state
% seq