代码搜索：Monte
找到约 1,028 项符合「Monte」的源代码
代码结果 1,028
www.eeworm.com/read/263879/11338237
m monte.m
%MonteCarlo法解最优化的例
clear;
vmax=-inf;
x2=specrnd(10:20,[],1,5);
x3=specrnd(-5:16,[],1,5);
for i=1:5
for j=1:5
if x2(i)+2*x3(j)>=10&3*x2(i)+2*x3(j)
www.eeworm.com/read/261878/11617768
m monte.m
clear;clc
N=input('输人模拟次数N=');
t=cputime; %计时起点
p=rand(1,3*N);%产生随机数
x1=norminv(p(1:N),551.4,44.1);
x2=norminv(p(N+1:2*N),0.70,0.05);
x3=norminv(p(2*N+1:3*N),0.85,0.09);
S=x1.*x2.*x3 ;
E=sum(S
www.eeworm.com/read/337307/12377638
m monte.m
%MonteCarlo法解最优化的例
clear;
vmax=-inf;
x2=specrnd(10:20,[],1,5);
x3=specrnd(-5:16,[],1,5);
for i=1:5
for j=1:5
if x2(i)+2*x3(j)>=10&3*x2(i)+2*x3(j)
www.eeworm.com/read/124283/14579205
c monte.c
#include
#include
#include
#include
#include
#include
/* Computation of the integ
www.eeworm.com/read/167728/5453086
c monte.c
#include
#include
#include
#include
#include
#include
/* Computation of the integ
www.eeworm.com/read/394381/8227909
m monte.m
%MonteCarlo法解最优化的例
clear;
vmax=-inf;
x2=specrnd(10:20,[],1,5);
x3=specrnd(-5:16,[],1,5);
for i=1:5
for j=1:5
if x2(i)+2*x3(j)>=10&3*x2(i)+2*x3(j)
www.eeworm.com/read/368337/9701219
c monte.c
#include
#include
#include
#include
#include
#include
/* Computation of th
www.eeworm.com/read/334860/12568328
m monte.m
%MonteCarlo法解最优化的例
clear;
vmax=-inf;
x2=specrnd(10:20,[],1,5);
x3=specrnd(-5:16,[],1,5);
for i=1:5
for j=1:5
if x2(i)+2*x3(j)>=10&3*x2(i)+2*x3(j)
www.eeworm.com/read/102394/15783198
c monte.c
#include
#include
#include
#include
#include
#include
/* Computation of the integ
www.eeworm.com/read/357935/10198221