代码搜索：minimum
找到约 5,594 项符合「minimum」的源代码
代码结果 5,594
www.eeworm.com/read/303435/3812374
sutaup
#! /bin/sh
#set -x
# input and output data
input1=data.su
output1=taup.su
output2=invtaup.su
output3=diff.su
# input parameters:
pmin=-0.0006 # minimum moveout in ms/m
pmax=0.0006 # ma
www.eeworm.com/read/351837/3098655
events
#
# MIPS 34K
#
# 34K has usually 4 counters per core which can optionally be limited to count
# events only on a single VPE or even TC.
#
event:0x0 counters:0,1,2,3 um:zero minimum:500 name:CYCLES : C
www.eeworm.com/read/471742/6888568
m ellipse.m
%ellipse.m - script to draw an ellipse with minimum radius rmim and
%eccentricity e.
clear;
rmin=2.5;
e=0.6;
th=[0:0.1:2*pi];
r=rmin*(1+e)./(1+e*cos(th));
rmax=rmin*(1+e)./(1+e*cos(pi));
polar
www.eeworm.com/read/369152/9661574
m rmve.m
function [X1,T1X,C1X]=RMVE(X)
%Syntax: [X1,T1X,C1X]=RMVE(X)
%____________________________
%
% Calculates the Reweighted Minimum Vulume Ellipsoid (RMVE) of a data
% set X.
%
% X1 is the data con
www.eeworm.com/read/429435/8808664
m greedysearch.m
%search a minimum weight parity check matrix for a generic parity check matrix using greedy algorithm
function H_opt=greedysearch(H_org,max_num,dead_upp)
n_k=size(H_org);
code_len=n_k(2);
chk_len=
www.eeworm.com/read/494702/6360696
txt 2009-2-20pku2253.txt
/*
题意 ：两个forger 一个froger 要蹦到另外一个froger处 他们的最短距离是这样定义的 ：
The frog distance (humans also call it minimax distance) between two stones therefore is defined as the minimum necessary
jump range over a
www.eeworm.com/read/486579/6535870
m my_gmres_schur_unsym.m
function [x,flag,relres,iter,resvec] = my_gmres_schur_unsym(L,U,B,C,b,restart,tol,maxit,M1,D,M2,x0)
%GMRES Generalized Minimum Residual Method.
% function [x,flag,relres,iter,resvec] = my_gmres_sc