代码搜索:study

找到约 4,321 项符合「study」的源代码

代码结果 4,321
www.eeworm.com/read/430037/1942754

m pr2_49.m

%Problem 2.49 %Experimental study of Gain-bandwidth trade-off for orthogonal signaling; clear all; close all; m=10; %number of transmitted bits; Ns=512; %oversampling parameter Ns*m/(2^m) should
www.eeworm.com/read/160391/5571200

m slam_kf.m

% This is like robot1, except we only use a Kalman filter. % The goal is to study how the precision matrix changes. seed = 0; rand('state', seed); randn('state', seed); if 0 T = 20; ctr
www.eeworm.com/read/160391/5571201

m paskin1.m

% This is like robot1, except we only use a Kalman filter. % The goal is to study how the precision matrix changes. seed = 1; rand('state', seed); randn('state', seed); if 0 T = 20; ctr
www.eeworm.com/read/194440/8195386

m aperstudy.m

% APERSTUDY: study the aperture effect % % Just run the script vo=1500;c=.6; A=[1000 4000 12000 20000]; z=0:25:20000; theta=zeros(length(A),length(z)); for k=1:length(A) theta(k,:)=thape
www.eeworm.com/read/235702/14055690

dev testasnparser.dev

[Project] FileName=testasnparser.dev Name=testasnparser UnitCount=27 Type=1 Ver=1 ObjFiles= Includes=E:\wangbin\study\mytest\test01\asn1parser Libs= PrivateResource= ResourceIncludes= MakeI
www.eeworm.com/read/235612/14062006

m aperstudy.m

% APERSTUDY: study the aperture effect % % Just run the script vo=1500;c=.6; A=[1000 4000 12000 20000]; z=0:25:20000; theta=zeros(length(A),length(z)); for k=1:length(A) theta(k,:)=thape
www.eeworm.com/read/430096/8766432

java sets17.java

// generics/Sets17.java // TIJ4 Chapter Generics, Exercise 17, page 645 /* Study the JDK documentation for EnumSet. You'll see that there's a * clone() method defined. However, you cannot clone()
www.eeworm.com/read/281848/9129814

java sets17.java

// generics/Sets17.java // TIJ4 Chapter Generics, Exercise 17, page 645 /* Study the JDK documentation for EnumSet. You'll see that there's a * clone() method defined. However, you cannot clone()
www.eeworm.com/read/380715/9133897

asv unc_nn_step.asv

function [fval]=unc_nn_step(x) %reference: %note that you can get the formulation of unc_nn_step from some %aritcles,such as %(1)JS Chun, HK Jung, SY Hahn A study on comparison of optimization %p
www.eeworm.com/read/380715/9133960

m unc_nn_step.m

function [fval]=unc_nn_step(x) %reference: %note that you can get the formulation of unc_nn_step from some %aritcles,such as %(1)JS Chun, HK Jung, SY Hahn A study on comparison of optimization %p