代码搜索：Demand
找到约 1,286 项符合「Demand」的源代码
代码结果 1,286
www.eeworm.com/read/456193/7355044
m fm_n1cont.m
function Pout = fm_n1cont
% FM_N1CONT compute power limits in transmission lines
% with an N-1 contingency criterion
%
%PMAX = FM_N1CONT (output stored in CPF.pmax)
%
%see also FM_SNB
%
%Aut
www.eeworm.com/read/456193/7355056
m fm_pareto.m
function fm_pareto
% FM_PARETO determine a Pareto set of the multi-objective
% OPF Problem
%
% FM_PARETO
%
%see also OPF structure
%
%Author: Federico Milano
%Date: 11-Nov-2002
%Upda
www.eeworm.com/read/301914/13845955
cpp trafficunit.cpp
//////////////////////////////////////////////////////////////////////
// Title: Geographic Load Balancing for Cellular Networks
// by emulating the behavior of air bubbles
//
www.eeworm.com/read/144211/5753167
motorola
#------------------------------------------------------------------------------
# motorola: file(1) magic for Motorola 68K and 88K binaries
#
# 68K
#
0 beshort 0520 mc68k COFF
>18 beshort ^000000
www.eeworm.com/read/131315/5937564
motorola
#
# Motorola
#
# 68K
#
0 beshort 0520 mc68k COFF
>18 beshort ^00000020 object
>18 beshort &00000020 executable
>12 belong >0 not stripped
>168 string .lowmem Apple toolbox
>20 beshort 0407 (
www.eeworm.com/read/490522/6447141
m vrp.m
%%遗传算法求解vrp问题(为选择操作从新设计后程序)
%D是距离矩阵，n为种群个数
%C为停止代数，遗传到第 C代时程序停止,C的具体取值视问题的规模和耗费的时间而定
%m为适配值淘汰加速指数,最好取为1,2,3,4,不宜太大
%交叉概率Pc，变异概率Pm
%R为最短路径,Rlength为路径长度
function VRP
%初始化
<mark>demand</mark>=[0 1 2 1 2 1 ...
www.eeworm.com/read/479200/6700716
cml tan_noc_worm_seg_test-test_recovered2.cml
node models:
tan_noc_test_source
link models:
path models:
demand models:
wdomain models:
riskgroup models:
www.eeworm.com/read/479200/6700726
cml tan_noc_worm_seg_test-test_recovered.cml
node models:
tan_noc_test_source
link models:
path models:
demand models:
wdomain models:
riskgroup models: