代码搜索：Capacity
找到约 2,190 项符合「Capacity」的源代码
代码结果 2,190
www.eeworm.com/read/358191/10194443
cpp load.cpp
// greedy container loading
#include
void IndirectSort(int w[], int t[], int n)
{// Cluge to test when weights already in order.
for (int i=1; i
www.eeworm.com/read/356335/10230852
hh numberlikearray.hh
#ifndef NUMBERLIKEARRAY_H
#define NUMBERLIKEARRAY_H
// Make sure we have NULL.
#ifndef NULL
#define NULL 0
#endif
/* A NumberlikeArray object holds a heap-allocated array of Blk with a
* lengt
www.eeworm.com/read/425114/10380783
m waterfilling_alg.m
function [Capacity PowerAllo] = WaterFilling_alg(PtotA,ChA,B,N0);
%
% WaterFilling in Optimising the Capacity
%===============
% Initialization
%===============
ChA = ChA + eps;
NA = length(ChA
www.eeworm.com/read/161587/10394126
cpp firstfit.cpp
// First fit bin packing
#include
#include "winner.h"
int winner(int a[], int b, int c)
{// For a max winner tree.
if (a[b] >= a[c]) return b;
return c;
}
void FirstFi
www.eeworm.com/read/161587/10394534
cpp load.cpp
// greedy container loading
#include
void IndirectSort(int w[], int t[], int n)
{// Cluge to test when weights already in order.
for (int i=1; i
www.eeworm.com/read/353865/10411404
m fig210.m
% the programm is designed for figure 2.10,
% fig210.m
% Monte-Carlo runs
clear
M = 4;
testnum = 2^(5);
probnum = 10^3;
outnum = 10^2;
SNR = 0 : 20;
Lsnr = length(S
www.eeworm.com/read/351847/10602806
h bc_def.h
/****************************************************************************
Device : AT90S2333
File name : BC_def.h
Ver nr. : 1.0
Description : This file has to
www.eeworm.com/read/350683/10719927
m waterfilling_alg.m
function [Capacity PowerAllo] = WaterFilling_alg(PtotA,ChA,B,N0);
%
% WaterFilling in Optimising the Capacity
%===============
% Initialization
%===============
ChA = ChA + eps;
NA = length(ChA
www.eeworm.com/read/419693/10844681
cpp arraylistnostl.cpp
// test the class arrayListNoSTL
#include
#include "linearList.h"
#include "arrayListNoSTL.h"
using namespace std;
int main()
{
// test constructor
linearList *x =
www.eeworm.com/read/419693/10844730
cpp arraylist.cpp
// test the class arrayList that uses STL algorithms
#include
#include "linearList.h"
#include "arrayList.h"
using namespace std;
int main()
{
// test constructor
linearLis