代码搜索:Problem

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

代码结果 10,000
www.eeworm.com/read/162075/10341946

m demgp.m

%DEMGP Demonstrate simple regression using a Gaussian Process. % % Description % The problem consists of one input variable X and one target variable % T. The values in X are chosen in two separated c
www.eeworm.com/read/425546/10349173

m demrbf1.m

%DEMRBF1 Demonstrate simple regression using a radial basis function network. % % Description % The problem consists of one input variable X and one target variable % T with data generated by samp
www.eeworm.com/read/161256/10432294

m my_yprime_m.m

function yp = yprime(t,y) % Differential equation system for restricted three body problem. % Think of a small third body in orbit about the earth and moon. % The coordinate system moves with the e
www.eeworm.com/read/161189/10439696

m baart.m

function [A,b,x] = baart(n) %BAART Test problem: Fredholm integral equation of the first kind. % % [A,b,x] = baart(n) % % Discretization of a first-kind Fredholm integral equation with % kernel
www.eeworm.com/read/161189/10440072

m bvls.m

% % x=bvls(A,b,l,u) % % Solves a bounded variables least squares problem % % min || Ax-b || % l
www.eeworm.com/read/353439/10446714

java lostmessagefound19.java

// exceptions/LostMessageFound19.java // TIJ4 Chapter Exceptions, Exercise 19, page 479 // Repair the problem in LostMessage.java by guarding the call in the // finally clause. class VeryImporta
www.eeworm.com/read/423551/10551080

txt floyd.txt

// Floyd-Warshall algorithm // // solves the all-pairs shortest path problem using Floyd-Warshall algorithm // inputs: nn, number of nodes // connectivity matrix cmat, where 0 means
www.eeworm.com/read/352425/10553302

java lostmessagefound19.java

// exceptions/LostMessageFound19.java // TIJ4 Chapter Exceptions, Exercise 19, page 479 // Repair the problem in LostMessage.java by guarding the call in the // finally clause. class VeryImporta
www.eeworm.com/read/159990/10581203

java synchronizedemo3.java

/** *A non-synchronize Producer/Concumer problem *2004.12.24. xhcprince */ class Q { int n; synchronized int get() { System.out.println("Get: " + n); try { Thread.sle
www.eeworm.com/read/159921/10588443

m testdich.m

function [X,I,alpha,theta] = testdich( dim, datanum ) % TESTDICH randomly creates test examples for dichotomy problem. % [X,I] = testgidich( dim, datanum ) % % TESTDICH creats test data randomly for