设有两个周期性的实时任务A和B，任务A要求每20ms执行一次，执行时间为10ms 任务B要求每50ms执行一次，执行时间为25ms 试编一调度程序按最小松弛度优先算法对这两个任务进行调度并输出每次调度时被调入运行任务的状态: (任务名，所处周期数，调度时刻，运行持续时间)。
标签： 周期
上传时间： 2013-12-25
上传用户：924484786
b-树的增加,因为我看到的资料里的最大关键字数目为m-1,我考虑了一下,2-3树的删除会比较麻烦,后来看了下算法导论,别人的数目是2t-1,所以相同情况下是2-3-4树,我考虑按照这个因子再写一个,增加删除部分,有问题可以联系我,联系方式在程序中已注明.
上传时间： 2017-04-04
上传用户：pkkkkp
一个报税管理系统AJAX第二版B-S.rar
上传时间： 2014-01-10
上传用户：qw12
b-树的增加,删除,已对八百万个数据进行过测试,而且是对多个M值
上传时间： 2014-01-17
上传用户：nairui21
c pgm to find redundant paths in a graph.Many fault-tolerant network algorithms rely on an underlying assumption that there are possibly distinct network paths between a source-destination pair. Given a directed graph as input, write a program that uses depth-first search to determine all such paths. Note that, these paths are not vertex-disjoint i.e., the vertices may repeat but they are all edge-disjoint i.e., no two paths have the same edges. The input is the adjacency matrix of a directed acyclic graph and a pair(s) of source and destination vertices and the output should be the number of such disjoint paths and the paths themselves on separate lines. In case of multiple paths the output should be in order of paths with minimum vertices first. In case of tie the vertex number should be taken in consideration for ordering.
标签： fault-tolerant algorithms redundant underlyin
上传时间： 2013-12-18
上传用户：jkhjkh1982
Hi guys, I have a B-spline curve algorithm by using Genetic algorithm. Any interested?
标签： algorithm interested B-spline Genetic
上传时间： 2017-04-13
上传用户：shawvi
this demo on neural network creation
标签： creation network neural this
上传时间： 2017-04-14
上传用户：s363994250
B-M 算法的matlab实现 密码学中又一重要的算法实现
上传时间： 2017-04-18
上传用户：二驱蚊器
this book is related to computer network based on linux.it s so useful for computer engineering students
标签： computer engineering related network
上传时间： 2013-12-27
上传用户：h886166
基本步骤如下： A:在编辑系统中 1-在需要统计的图层新加一个字段准备存储分颜色属性 2-依据不同颜色参数给刚才准备的字段赋属性 B：在属性管理系统中 1-将属性导出成EXCEL表格或者dbf表格 2-在相应程序里分类统计
上传时间： 2014-11-29
上传用户：weiwolkt
