代码搜索：Capacity

找到约 2,190 项符合「Capacity」的源代码

代码结果 2,190
热门代码： main.c GPIO I2C SPI UART timer interrupt ADC PWM LED
www.eeworm.com/read/259580/11780596

cpp greedyloading.cpp

// greedy container loading #include #include "container.h" #include "heapSort.h" using namespace std; void containerLoading(container* c, int capacity, i
·
www.eeworm.com/read/345341/11818758

cs roundstack.cs

#region license /* Copyright (c) 2007 Lu Yixiang Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Softwar
·
www.eeworm.com/read/254858/12114956

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/340663/12140892

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/253865/12181753

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/253533/12216463

txt 24.2.txt

Listing 24.2 Interface Declarations for a .NET Object using System; namespace DotNetObject { public interface IVehicle { int Wheels { get; set; } } public interface IAirVehicle : IVehicle
·
www.eeworm.com/read/337090/12392219

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/148732/12432273

txt readme.txt

********Algorithme Glouton******** (numbers of bag)28 (the price)560 1125 68 328 47 122 196 41 25 115 82 22 631 132 420 86 42 103 81 26 49 316 72
·
www.eeworm.com/read/132141/14107153

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/132141/14107453

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
·