代码搜索：Problem
找到约 10,000 项符合「Problem」的源代码
代码结果 10,000
www.eeworm.com/read/418731/10931951
txt disable windows logo key.txt
i was recently playing games and this nasty windos logo key keep annoying me , cause i often accidently clicked it , and i start to search a solution to solve my problem, and found the following artic
www.eeworm.com/read/418731/10934234
txt 201.txt
ANFOS
ANFO is an acronym for Ammonium Nitrate - Fuel Oil Solution. An ANFO
solves the only other major problem with ammonium nitrate: its tendency to
pick up water vapor from the air.
www.eeworm.com/read/272894/10937054
dpr ex.dpr
{
this problem can use Dijkstra
but i use BFS
note: the shown number of exchange plate must be in current plate.
but the hidden number of exchange plate needn't be in current plate.
}
prog
www.eeworm.com/read/418304/10955163
m fm_opfm.m
function fm_opfm
%FM_OPFMR solves the OPF-based electricity market problem by means of
% an Interior Point Method with a Merhotra Predictor-Corrector
% or Newton direction technique.
www.eeworm.com/read/271940/10975715
m ga_fs.m
%GA_fs denote the Genetic Algorithm Flow Shop Scheduling Problem
function GA_fs()
global Pm
global Pc %probability of crossover
global chromosome
global everyGenResult
global boundGen
www.eeworm.com/read/469416/6976466
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/469416/6976497
m demmlp1.m
%DEMMLP1 Demonstrate simple regression using a multi-layer perceptron
%
% Description
% The problem consists of one input variable X and one target variable
% T with data generated by sampling X a
www.eeworm.com/read/466243/7041413
m programs_14a.m
% Chapter 14 - Poincare Maps and Nonautonomous Systems in the Plane.
% Programs 14a - Solving an initial value problem.
% Copyright Birkhauser 2004. Stephen Lynch.
% Solve a differential equation
www.eeworm.com/read/465758/7045142
txt 7.txt
function [sp, spcost] = dijkstra(matriz_costo, s, d)
% This is an implementation of the dijkstra磗 algorithm, wich finds the
% minimal cost path between two nodes. It磗 supoussed to solve the problem
www.eeworm.com/read/465637/7050948
java tsp.java
/** The Traveling Sales Person problem solution class
* This program includes four TSP solution methods
* @author Arnas Kainskas and modified by Softhut Group
* @author i5arka@vaidila.vdu.lt
*