Hot Search : Source embeded web remote control p2p game More...
Location : Home Search - 3-opt
Search - 3-opt - List
DL : 0
The architecture of this set of codes and the interaction among them is shown in Figure 1. The main testing code main code.m calls the code riemann grad unit opt.m that performs Riemannian optimization under unitary matrix constraint. Steepest Descent/Ascent (SD/SA) algorithm (see Table 3.2 in [1]), Conjugate Gradient (CG-PR, CG-FR) algo- rithms (both Fletcher-Reeves and Polak-Ribi`ere formulas, see Table 3.3 in [1]), are im- plemented. This code further calls the codes implementing line search methods: Armijo method geod search armijo.m, as well as the polynomial and DFT-based approximation
Update : 2024-05-06 Size : 310272 Publisher : dave

属性页源代码 upd_creating_cprop_appl 用于展示调用出属性页,查看调用过程源代码-upd_creating_cprop_appl (1 folders, 10 files, 102.26 KB, 112.26 KB in total.)    FScript.rc 3.71 KB    ico00001.ico 318 bytes    icon1.ico 766 bytes    NewPropertySheet.dsp 3.71 KB    NewPropertySheet.dsw 555 bytes    NewPropertySheet.ncb 41.00 KB    NewPropertySheet.opt 47.50 KB    NewPropertySheet.plg 1.58 KB    resource.h 1.11 KB    TheApp.cpp 2.05 KB   Release (0 folders, 1 files, 10.00 KB, 10.00 KB in total.)      NewPropertySheet.exe 10.00 KB
Update : 2024-05-06 Size : 16384 Publisher : lzy

DL : 0
随机给出一个页面执行序列,如:1,5,3,4,2,1,3,4,5,7,9,……。要求计算以下几种置换算法的缺页数、缺页率和命中率。   最佳置换算法OPT(Optimal)   先进先出算法FIFO(First In First Out)  最近最少使用算法LRU(Least Recently Used)-Random page gives an execution sequence, such as: 1,5,3,4,2,1,3,4,5,7,9, ....... Require replacement algorithm for computing several missing pages, missing pages rate and hit rate.   optimal replacement algorithm OPT (Optimal)   FIFO algorithm FIFO (First In First Out)  least recently used algorithm LRU (Least Recently Used)
Update : 2024-05-06 Size : 3072 Publisher : 谢韵垚

CSharpLFU
DL : 0
是flu算法 是在命令行中输入数据流来进行调度,有计算缺页率。不是从txt中读取。是为了。LFU是最近最不常用页面置换算法(Least Frequently Used),也就是淘汰一定时期内被访问次数最少的页!要求在页置换时置换引用计数最小的页,因为经常使用的页应该有一个较大的引用次数-Main page scheduling algorithm: FIFO, least recently used scheduling algorithm (LRU), least recently used scheduling algorithm (LFU), the best algorithm (OPT) subject requirements: ① the realization of the three algorithms: 1, FIFO 2, OPT 3, LRU ② page sequence the specified text file (TXT files) out of ③ Output: the first line: every time out the page number, the second line: shows the total number of missing pages
Update : 2024-05-06 Size : 5120 Publisher : Alice zang

DL : 0
基于台湾南翔的OPT单片机开发的电机控制程序,采用内容晶振,低功耗,可直接做项目。-1.run 10S stop 10S. 2.OSC:455KHz IRC 8T 3. TMR0 Prescaler rate 1:32 4. TMR0 interrupt 10ms per times
Update : 2024-05-06 Size : 61440 Publisher : 骆炳福

Three channel types. Three sizing options. Constant Manning coefficient Excel spread sheet with Visual Basic functions
Update : 2024-05-06 Size : 221184 Publisher : Karl

DL : 0
编写一个请求页式存储管理模拟程序,通过对页面置换过程的模拟,加深对请求页式存储管理方式基本原理及实现过程的理解。 要求: 1. 从键盘输入页面访问序列及分配给进程的内存块数; 2. 分别采用OPT、FIFO和LRU算法进行页面置换(说明:对于OPT算法,在有多个页面可选的情况下,先淘汰较早进入的页面)。 3. 计算缺页次数及缺页率。 测试用例格式如下: 输入: 算法(1 OPT,2 FIFO,3 LRU) 内存块数 页面序列(页面1,页面2,页面3,...) 输出: 页面变化时内存块装入页面列表1-是否命中/页面变化时内存块装入页面列表2-是否命中/... 缺页次数 其中: 页面变化时内存块装入页面列表:内存块1装入页面,内存块2装入页面,内存块3装入页面...,未装入任何页面时由 -”表示 是否命中:1-命中,0-缺页-Write a request page storage management simulation program, through the page replacement process simulation, to deepen understanding of the requested page storage management basic principles and processes. Requirements: 1. Memory blocks the keyboard to access the page sequence and allocated to the process 2. respectively OPT, FIFO and LRU page replacement algorithm (Note: For OPT algorithm, in case there are multiple pages optional, elimination of early entry into the first page). 3. Calculate the number of page faults and page fault rate. Test format is as follows: Input: Algorithms (1- OPT, 2- FIFO, 3- LRU) memory block sequence number of pages (page 1, page 2, page 3, ...) Output: change the page memory block load page loaded memory block list list of pages that have been hit 1-/2- page changes if hit/... number of page faults wherein: when the page is loaded into memory block change list page: 1 load the page memory block, memory block 2 load the page, the page is loaded ... memo
Update : 2024-05-06 Size : 1024 Publisher : 刘先生

Simulated annealing to solve the capacitated vehicle problem coded in Python program. This file contains 3 sub-programs which tries to improve the initial solution. (i.e. Simulated annealing + 2-point, Simulated annealing + 2-opt, Simulated annealing + 3-point).-Simulated annealing to solve the capacitated vehicle problem coded in Python program. This file contains 3 sub-programs which tries to improve the initial solution. (i.e. Simulated annealing+ 2-point, Simulated annealing+ 2-opt, Simulated annealing+ 3-point).
Update : 2024-05-06 Size : 76800 Publisher : 站长

DL : 0
TSP算法 1 C语言TSP算法 2 2-OPT,orOPT摄动 3 Main单独执行()
Update : 2024-05-06 Size : 1024 Publisher : HOOV%2118675

本代码可用来提取计算心率变异性非线性域特征值(SampEnVal, AlphaDFA, AlphaDFA1, AlphaDFA2 )(Extract Nonlinear features of HRV. %Inputs: RRI = inter-beat interval (s) and time locations (s) % opt = analysis options from gui % %Outputs: output is a structure containg all HRV. %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % Copyright (C) 2010, John T. Ramshur, jramshur@gmail.com % % This file is part of HRVAS % % HRVAS is free software: you can redistribute it and/or modify % it under the terms of the GNU General Public License as published by % the Free Software Foundation, either version 3 of the License, or % (at your option) any later version. % % HRVAS is distributed in the hope that it will be useful, % but WITHOUT ANY WARRANTY; without even the implied warranty of % MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the % GNU General Public License for more details.)
Update : 2024-05-06 Size : 305152 Publisher : HeJimin
« 1 2 3 4 5 6»
DSSZ is the largest source code store in internet!
Contact us :
1999-2046 DSSZ All Rights Reserved.