代码搜索：Problem

找到约 10,000 项符合「Problem」的源代码

代码结果 10,000
热门代码： main.c GPIO I2C SPI UART timer interrupt ADC PWM LED
www.eeworm.com/read/343751/11930498

m hmukai.m

function [h, A] = hmukai(x, ctrl) %Call: [h A]=hmukai(x,ctrl) %Evaluate both the constraints and the corresponding %Jacobian if ctrl>0, for the problem below at x %The problem is defined as h(x)>=
·
www.eeworm.com/read/343751/11930518

m ctp269.m

function [c, A] = ctp269(x, ctrl) %Call: [c A]=ctp269(x,ctrl) %Evaluate both the constraints and the corresponding %Jacobian if ctrl>0, for the problem below at x %The problem is defined as c(x)=0
·
www.eeworm.com/read/343751/11930532

m folinmod.m

function [f, J] = fOlinMod(x, ctrl, t, u) %Call: [f J]=fOlinMod(x,ctrl,t,u) %Evaluate the residuals corresponding %to the objective in a nonlinear lsq problem. %If ctrl>0 the Jacobian J should be
·
www.eeworm.com/read/343707/11933549

txt readme.txt

Delphi VCLSkin 4.98 website : http://www.link-rank.com email : info@link-rank.com VCLSkin is a component to create skinnable user interface for Delphi/C++Builder application, It
·
www.eeworm.com/read/256068/12029957

txt readme.txt

Delphi VCLSkin 4.11 website : http://www.link-rank.com email : info@link-rank.com VCLSkin is a component to create skinnable user interface for Delphi/C++Builder application, It
·
www.eeworm.com/read/342223/12034736

m ispanneal.m

%function [e,f]=ISPanneal(L,s,t,dt,lamda,w,N) % %独立集问题(Independent Set Problem)的退火算法 %设有图G=(V,E),要找V的最大独立集，即找最大的V'属于V, %满足其中的任意两点都不关联 % %N为问题规模，即节点个数；w为权矩阵 %e为以0、1为元素的数组，来表示两个子集 %lamda是一个大于1的罚
·
www.eeworm.com/read/342221/12034750

m mcpanneal.m

%function [e,f]=MCPanneal(L,s,t,dt,w,N) %最大截问题(Max Cut Problem)的退火算法 %由于算法的缺陷，当f值在较长时间内不再改变时，可用cl+c停止程序 %N为问题规模，即节点个数；w为权矩阵 %L可取较大值，如500、1000； %s取1、2等；t为初始温度，参考范围为0.5--2； %dt为衰减因子，一般不小于0.9; %e为
·
www.eeworm.com/read/151948/12158779

cpp knight_moves.cpp

/* Author: BlueBlood--六院一队吴诚堃是也，其学号：200306020093 Explantion: Perhaps many people like to use recursion mathod, but as I have been practise using Dynamic Programming, I did it in my own DP
·
www.eeworm.com/read/339997/12188519

m ispanneal.m

%function [e,f]=ISPanneal(L,s,t,dt,lamda,w,N) % %独立集问题(Independent Set Problem)的退火算法 %设有图G=(V,E),要找V的最大独立集，即找最大的V'属于V, %满足其中的任意两点都不关联 % %N为问题规模，即节点个数；w为权矩阵 %e为以0、1为元素的数组，来表示两个子集 %lamda是一个大于1的罚
·
www.eeworm.com/read/339626/12216374

cpp dnw.cpp

#define STRICT #define WIN32_LEAN_AND_MEAN #include #include #include #include #include #include #include
·