代码搜索结果

Graph graphs/data/g18.dat read from file Vertices: 100 Edges: 922 Empty set initialization Simulated annealing algorithm PARAMETERS: t0: 0.3 t1:0.2 alpha:0.999 i_l:5 INI_SOL: 0Trace file: trace

Graph graphs/data/tg100.10.dat read from file Vertices: 100 Edges: 394 Empty set initialization Simulated annealing algorithm PARAMETERS: t0: 0.3 t1:0.2 alpha:0.999 i_l:5 INI_SOL: 0Trace file:

Graph graphs/data/rg50.5.dat read from file Vertices: 50 Edges: 183 Empty set initialization Simulated annealing algorithm PARAMETERS: t0: 0.3 t1:0.2 alpha:0.999 i_l:5 INI_SOL: 0Trace file: tra

t0 0.30 t1 0.20 alpha 0.999 innerloop 5 //Only first four lines are read by sa algorithm // inner-loop parameters: // innerloop 0 - vertices // 1 - 2*vertices // 2 - vertic

// The SA algorithm for maximum planar subgraph problem, 2003 // University of Tampere, Finland // Department of Computer and Information Sciences // Corresponding author: Timo Poranen, tp@cs.uta.f

Implements H-TCP congestion control algorithm for ns version 2.26. March 27th 2004. See www.hamilton.ie/net for further details. To install: Extract this zip archive. Copy files tcp.cc and tcp.

% make rp structure to be used for passing run % parameters to the run_lms_pred algorithm rp.Nruns = 100; rp.Ndata = 500; rp.mult = 200; rp.verbose = 0; rp.mu = 0.05; rp.a =

% dp.m % % This program implements the dynamic programming algorithm % for determining the three change times of a signal that % consists of four unknown DC levels in WGN (see Figure 12.4). %

Algorithm Analysis Data Structures and

function [B,A,C,D] = PressureDetectInterbeat(x,fsa,wla,pfa); %PressureDetectInterbeat: Pressure detector algorithm (ICP & ABP) % % [B, A, C, D] = PressureDetectInterbeat(x,fs,wl,pf); % % x Inpu