代码搜索:minimum
找到约 5,594 项符合「minimum」的源代码
代码结果 5,594
www.eeworm.com/read/362989/2925165
h local_lim.h
/* Minimum guaranteed maximum values for system limits. Linux version.
Copyright (C) 1993-1998,2000,2002,2003,2004 Free Software Foundation, Inc.
This file is part of the GNU C Library.
The
www.eeworm.com/read/359369/2978522
m minbrack.m
function [br_min, br_mid, br_max, num_evals] = minbrack(f, a, b, fa, ...
varargin)
%MINBRACK Bracket a minimum of a function of one variable.
%
% Description
% BRMIN, BRMID, BRMAX, NUMEVALS
www.eeworm.com/read/357022/3035113
data master5.data
$TTL 1000
@ in soa localhost. postmaster.localhost. (
1993050801 ;serial
3600 ;refresh
1800 ;retry
604800 ;expiration
3600 ) ;minimum
a any ns ns.vix.com.
a in ns ns2vix.com
www.eeworm.com/read/260597/4331501
txt maxmin.txt
SUMMARY maximum and minimum routines.
#include
cProc max,
parmW a
parmW b
cProc min,
parmW a
parmW b
cProc lmax,
parmD a
parmD b
cProc lmin,
www.eeworm.com/read/254811/4380440
txt maxmin.txt
SUMMARY maximum and minimum routines.
#include
cProc max,
parmW a
parmW b
cProc min,
parmW a
parmW b
cProc lmax,
parmD a
parmD b
cProc lmin,
www.eeworm.com/read/160611/5568499
c pa_minlat.c
/*
* $Id: pa_minlat.c,v 1.2 2003/03/02 08:01:40 dmazzoni Exp $
* paminlat.c
* Experiment with different numbers of buffers to determine the
* minimum latency for a computer.
*
* Author: Phil Bur
www.eeworm.com/read/152843/5657268
h minstate.h
#include
#include
#include "entry.h"
/*
* DO_SAVE_MIN switches to the kernel stacks (if necessary) and saves
* the minimum state necessary that allows us to turn ps
www.eeworm.com/read/471453/6892673
m demo3.m
function demo3
%DEMO3 Demo for usage of DIFFERENTIALEVOLUTION.
% DEMO3 starts searching the minimum of Shekel's Foxholes as a demo. This
% demo is similar to DEMO2 except that it uses a function to
www.eeworm.com/read/471453/6892681
m demo2.m
function demo2
%DEMO2 Demo for usage of DIFFERENTIALEVOLUTION.
% DEMO2 starts searching the minimum of Shekel's Foxholes as a demo.
% Modify this function for your first optimization.
%
% Markus B
www.eeworm.com/read/393518/8281095
m lpcrand.m
function ar=lpcrand(p,n,bw)
% generate n random stable polynomials of order p with a minimum pole
% bandwidth of bw*fs where fs is the sampling fequency.
% To limit the pole radius to r set bw=-log