代码搜索：Monte
找到约 1,028 项符合「Monte」的源代码
代码结果 1,028
www.eeworm.com/read/190245/8446529
monte carlo matlab
www.eeworm.com/read/184067/9123811
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/179705/9342153
c monte.c
#include
#include
#include
#include
#include
#include
/* Computation of the integ
www.eeworm.com/read/365993/9837333
cpp monte.cpp
#include
#include
using namespace std;
void main()
{
double m = 0;
for(int i=0;i
www.eeworm.com/read/166306/10024617
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/360770/10079243
m monte.m
function y = monte (a,b,n,f)
%------------------------------------------------------------------------
% Usage: y = monte (a,b,n,f)
%
% Description: Use the Monte Carlo method to integrate a
www.eeworm.com/read/358694/10181703
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/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/424281/10468178
c monte.c
#include
#include
#include
#include
#include
#include
/* Computation of the integ
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)