代码搜索：Problem
找到约 10,000 项符合「Problem」的源代码
代码结果 10,000
www.eeworm.com/read/386774/8727901
c defs.c
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
www.eeworm.com/read/430470/8744069
m exact51.m
function y=exact51(x,a)
% the exact solution for chapter 5 problem1 ,
% y = exp(a*x) +x;
y = exp(a*x) +x;
www.eeworm.com/read/428779/8841680
m heurset.m
function problem = heurset(varargin)
%HEURSET Set options for the various heuristic optimizers
%
% Usage:
%
% heurset (to display a quick summary of all the options
www.eeworm.com/read/428779/8841695
m godlike.m
function [sol, fval, evals] = godlike(varargin)
%GODLIKE Optimization using the GODLIKE algorithm
%
% Usage:
% sol = GODLIKE(PROBLEM)
% sol = GODLIKE(func, popsize, lb, ub)
www.eeworm.com/read/384566/8860234
java deproblem.java
package DeApp1.problem;
import java.awt.*; // Import all classes from the java.awt package
// AWT is the Abstract Window Toolkit. The AWT
import java.io.*;
imp
www.eeworm.com/read/427909/8913659
m hungarian.m
function [C,T]=hungarian(A)
%HUNGARIAN Solve the Assignment problem using the Hungarian method.
%
%[C,T]=hungarian(A)
%A - a square cost matrix.
%C - the optimal assignment.
%T - the cost of the
www.eeworm.com/read/185152/9054836
m dsobjg.m
function g=dsobjg(x)
% Usage:
% g=dsobjg(x)
% Calculates the gradient of the objective function
% at a point for Shell Dual Problem
global A B C D E
x=x(:);g=x;
g(1:5)=6*D.*x(1:5).^2
www.eeworm.com/read/185152/9054970
m dscntg.m
function g=dscntg(x)
% Usage:
% g=dscntg(x)
% Calculates the gradient of the constraint with the maximal
% residual at a point for Shell Dual Problem
global A B C D E
x=x(:); g=zeros(si
www.eeworm.com/read/381326/9097732
cpp dnw.cpp
#define STRICT
#define WIN32_LEAN_AND_MEAN
#include
#include
#include
#include
#include
#include
#include
www.eeworm.com/read/381326/9097756
bak dnw.cpp.bak
#define STRICT
#define WIN32_LEAN_AND_MEAN
#include
#include
#include
#include
#include
#include
#include