代码搜索：minimum
找到约 5,594 项符合「minimum」的源代码
代码结果 5,594
www.eeworm.com/read/272894/10937331
dpr ex.dpr
{
DP by Queue and Hash
State H(HP,MP,P)
HP is hero's HP.
MP is hero's MP.
P is where the monsters stand.
H is the minimum sum of all the monsters' HP.
}
program Ural_1240(Input,Output);
www.eeworm.com/read/469397/6974546
m qam4.m
% Function for 16 - QAM Modulation Take a minimum 1*4 element input to
% Modulate
% i_qam use for input
% o_qam use for output of qam
function o_qam = qam4(i_qam)
% disp('QAM 16 modulation'
www.eeworm.com/read/139144/13187185
cpp main.cpp
/*
* filename: main.cpp
* src: d:\vc71\boost-1_31_0\work\src\kruskal_mst\
* date: 29/8 2004
* function: demonstrate the use of the kruskal minimum spanning tree algorithm
* kru_mst.hpp the i
www.eeworm.com/read/313009/13598744
h itemset.h
//class for itemSet
#include
#include "items.h"
typedef int Item; //???????????????这里是什么意思？这样做便于将来方便修改小项的类型
/* to find the minimum and maximum integer from two parameters *
www.eeworm.com/read/140704/5784339
cc bw_minlen_0.cc
// file: bw_minlen_0.cc
//
// isip include files
//
#include "bw_train.h"
#include "bw_train_constants.h"
// method: get_minlen_cc
//
// arguments:
// int_4& min_len : (output) the minimum length r
www.eeworm.com/read/136989/5836467
bor tao_ifr_be_dll.bor
# TAO_IFR_BE_DLL.bor,v 1.4 2003/12/23 21:20:17 dhinton Exp
#
# Makefile for building the TAO_IFR_BE_DLL library
#
!ifndef MINIMUM_CORBA
NAME = TAO_IFR_BE_DLL
!else
!undef NAME
!endif
OBJF
www.eeworm.com/read/260790/11702039
m4 acinclude.m4
# Configure paths for GTK+
# Owen Taylor 97-11-3
dnl AM_PATH_GTK([MINIMUM-VERSION, [ACTION-IF-FOUND [, ACTION-IF-NOT-FOUND [, MODULES]]]])
dnl Test for GTK, and define GTK_CFLAGS and GTK_LIBS
dnl
www.eeworm.com/read/346479/11742587
m4 check.m4
dnl AM_PATH_CHECK([MINIMUM-VERSION, [ACTION-IF-FOUND [, ACTION-IF-NOT-FOUND]]])
dnl Test for check, and define CHECK_CFLAGS and CHECK_LIBS
dnl
AC_DEFUN([AM_PATH_CHECK],
[
AC_ARG_WITH([check],
[
www.eeworm.com/read/151091/12235702
m sq32qam_gray_map2.m
function out=sq32QAM_Gray_map2(input)
K=length(input)/5;
d=1/sqrt(20); %%% The minimum distance between constellations is 2*d
x=d*[5,3,1,-1,-3,-5]; %%% coordinate matrix
y
www.eeworm.com/read/336235/12462233
c ex6.c
#include
#include
#include
#include "math_util.h"
/*
This problem is from Bryson, A. and Ho, Y., Applied Optimal Control, pages 52-55
Minimum drag nose shape in hype