代码搜索：montecarlo
找到约 154 项符合「montecarlo」的源代码
代码结果 154
www.eeworm.com/read/353896/10407193
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/273093/10927606
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/172061/7074847
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/197958/7960828
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/196814/8058834
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/244945/12829615
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/329331/12960615
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/147529/5728694
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/147529/5728904
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/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)