代码搜索：Problem

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

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

bp xor.bp

* This is the classic xor problem z = xor(x,y). X and y are input and * z needs to be computed or maybe its more accurate to say the network * needs to memorize the output z for each x and y. * *
·
www.eeworm.com/read/158463/11612865

m ip_01_07.m

% MATLAB script for Illustrative Problem 7, Chapter 1. echo on df=0.01; % Freq. resolution fs=5; % Sampling frequency ts=1/fs; % Sampling interval t=[-5:ts:5];
·
www.eeworm.com/read/158463/11613271

m ip_09_04.m

% MATLAB script for Illustrative Problem 4, Chapter 9. echo on Lc=20; % Number of chips per bit A1=3; % amplitude of the first sinusoidal interference A2=7; % amplitude of the second
·
www.eeworm.com/read/347945/11623353

m mpt_reduce.m

function [Matrices,infeasible] = mpt_reduce(Matrices) % Projects the whole mp(Q)LP problem on Aeq*U + Beq*x = beq % differs from mpt_project_on_equality in the sense that it % separates the intege
·
www.eeworm.com/read/347943/11626275

m preprocesssdp.m

function [newAt,newb,newc,newK,prepinfo]=preprocessSDP(At,b,c,K) %[newAt,newb,newc,newK,prepinfo]=preprocessSDP(At,b,c,K) %Preprocess the SDP part of a problem, return the new variables and the %info
·
www.eeworm.com/read/346392/11751479

m mst_k.m

%MST_k.m %This program solves the Minimum Spanning Tree problem by using Kruskal Algorithm.') n=input('Enter the vertices number of the graph:n= ') W=input('Enter the weight adjacent matrix of the
·
www.eeworm.com/read/259886/11759429

m prprob.m

function [alphabet,targets] = prprob() %PRPROB Character recognition problem definition % % [ALHABET,TARGETS] = PRPROB() % Returns: % ALPHABET - 35x26 matrix of 5x7 bit maps for each lette
·
www.eeworm.com/read/156735/11780704

c panic.c

/* * linux/kernel/panic.c * * (C) 1991 Linus Torvalds */ /* * This function is used through-out the kernel (includeinh mm and fs) * to indicate a major problem. */ #include
·
www.eeworm.com/read/345785/11792147

txt pcprb1.out.txt

PCPRB1: PITCON test problem Freudenstein-Roth function Number of equations is 2 Number of variables is 3 Step Type of point X(1) X(2) X(3) 0 Start
·
www.eeworm.com/read/344238/11897712

java finaloverridingillusionex.java

// reusing/FinalOverridingIllusionEx.java // TIJ4 Chapter Reusing, Exercise 20, page 269 // Show that the @Override annotation solves the problem in ths section import static net.mindview.util.Prin
·