代码搜索：minimum
找到约 5,594 项符合「minimum」的源代码
代码结果 5,594
www.eeworm.com/read/187030/8881770
h nessie.h
#ifndef PORTABLE_C__
#define PORTABLE_C__
#include
/* Definition of minimum-width integer types
*
* u8 -> unsigned integer type, at least 8 bits, equivalent to unsigned char
* u16
www.eeworm.com/read/427233/8959673
m mcf.m
input(' This program solves the minimum-cost flow problem.')
n=input('Enter the number of the verties : ')
W=input('Enter the cost matrix as W(s,s): ') %W(i,j)=inf if (i,j) isn't in graph
C=inpu
www.eeworm.com/read/427233/8959681
m zhuliu1.m
input(' This program solves the minimum-cost flow problem.')
n=input('Enter the number of the verties : ')
W=input('Enter the cost matrix as W(n,n): ') %W(i,j)=inf if (i,j) isn't in graph
r=inpu
www.eeworm.com/read/168118/9937252
m wavemin.m
function [w,tw]=wavemin(dt,fdom,tlength,m)
% WAVEMIN: creates a minimum phase w for impulsive sources
%
% [w,tw]=wavemin(dt,fdom,tlength,m)
% [w,tw]=wavemin(dt,fdom,tlength)
% [w,tw]=wavemin(dt,f
www.eeworm.com/read/162867/10262445
m minisi.m
%MINISI minimum-ISI TEQ design.
% [W, D, Dv] = MINISI(Sx, Sn, Sh, H, N, Nb, Nw, Dmin, Dmax, M)
% returns the time domain equalizer in W and the delay in D.
% Dv is a vector containing the remaining IS
www.eeworm.com/read/417519/10986785
m4 gmp-check.m4
# Check for GMP
# Zhuliang Chen, 2004-07
# Modified by Pascal Giorgi, 2003-12-03
dnl IML_CHECK_GMP ([MINIMUM-VERSION [, ACTION-IF-FOUND [, ACTION-IF-NOT-FOUND]]])
dnl
dnl Test for the GNU Multiprecis
www.eeworm.com/read/454252/7395525
txt answer.txt
1.This machine's estimated clock rate is: 758065000 cycles per second
2.in cycles: 2431676
in seconds:56550
3.maximum:2531664
minimum:810248
4.total:99
5.timer interrupts:83
6.10
www.eeworm.com/read/443984/7619700
m4 acinclude.m4
dnl @synopsis AC_PATH_GENERIC(LIBRARY [, MINIMUM-VERSION [, ACTION-IF-FOUND [, ACTION-IF-NOT-FOUND]]])
dnl
dnl Runs a LIBRARY-config script and defines LIBRARY_CFLAGS and LIBRARY_LIBS
dnl
dnl The scri
www.eeworm.com/read/440374/7690059
cpp sparse_table_algorithm.cpp
/*A better approach is to preprocess RMQ for sub arrays of length 2k using dynamic programming.
We will keep an array M[0, N-1][0, logN] where M[i][j] is the index of the minimum value in the sub ar
www.eeworm.com/read/439841/7700936
m eigen.m
%EIGEN Solves the eigenvalue problem in design of the unit-energy constrained
% minimum mean-squared error time domain equalizer.
% [B, W, D, MSE, R, Dv] = EIGEN(RXX, RYY, RXY, Dmin, Dmax, Nb, Nw, L