代码搜索:Problem

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

代码结果 10,000
www.eeworm.com/read/427233/8959616

m f_short.m

%This function is using the Floyd algrithm to solve the shortest path problem function y=short(n,U); S=zeros(n,n); for i=1:n for j=1:n S(i,j)=j; end end for m=1:n for i=
www.eeworm.com/read/283938/8978689

m contents.m

% Higher-Order Spectral Analysis Toolbox - Demo suite % Version 2.0.3 (R12 compliant) 27 Dec 2000 % % hosademo : main demo file % all other .m files in this directory are invoked by hosademo
www.eeworm.com/read/426702/9003612

news

Version 0.6 (9/5/2004) ====================== Important fixes for running as root systems with /dev/ptmx! Earlier versions screwed up permissions on /dev/ptmx on some systems, making a real mess. O
www.eeworm.com/read/185152/9054806

m dscntf.m

function f=dscntf(x) % Usage: % f=dscntf(x) % Calculates the maximal residual for the set of constraints % at a point for Shell Dual Problem global A B C D E x=x(:); f=max([A'*x(6:15) -
www.eeworm.com/read/185152/9054919

m initpt.m

% initpt % ------ %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % function [n,m,x]=initpt(nprob,factor) % This function generates the starting points for each problem
www.eeworm.com/read/183616/9148666

htm translate.htm

www.eeworm.com/read/379751/9178655

readme

Python-to-libsvm interface Introduction ============ Python (http://www.python.org/) is a programming language suitable for rapid development. This python-to-libsvm interface is developed so users
www.eeworm.com/read/181178/9268685

htm partvii.htm

Intro to Algorithms: PART VII: Selected Topics
www.eeworm.com/read/181178/9268981

htm chap36.htm

Intro to Algorithms: CHAPTER 36: NPCOMPLETENESS
www.eeworm.com/read/177853/9430378

me read.me

Embedded Systems Building Blocks Complete and Ready-to-Use Modules in C Version 2.00