oalib

Publish in OALib Journal

ISSN: 2333-9721

APC: Only $99

Submit

Any time

2019 ( 82 )

2018 ( 1558 )

2017 ( 1626 )

2016 ( 1789 )

Custom range...

Search Results: 1 - 10 of 77839 matches for " 蒋昌俊? "
All listed articles are free for downloading (OA Articles)
Page 1 /77839
Display every page Item
矩阵乘法的一个最佳算法

科学通报 , 1989,
Abstract: 一、引言 矩阵乘法是线性代数中常见的问题之一,许多数值计算问题都包含着矩阵乘法的计算。因此,降低矩阵乘法算法的时间复杂度问题,多年来一直引起算法研究者们的高度重视。 1969年,Strassen提出了一个时间复杂度为O(n~(log_2~7))的矩阵乘法算法,第一次突破了O(n~3)的界限,被誉为“在代数复杂性理论中最激动人心的结果”。以后,又出现了一系列新
矩阵乘法的一个最佳算法

科学通报 , 1989,
Abstract: 一、引言矩阵乘法是线性代数中常见的问题之一,许多数值计算问题都包含着矩阵乘法的计算。因此,降低矩阵乘法算法的时间复杂度问题,多年来一直引起算法研究者们的高度重视。1969年,Strassen提出了一个时间复杂度为O(n~(log_2~7))的矩阵乘法算法,第一次突破了O(n~3)的界限,被誉为“在代数复杂性理论中最激动人心的结果”。以后,又出现了一系列新
Petri网的广义笛积运算

自动化学报 , 1993,
Abstract:
可修生产线生产率及缓冲库存的预计
疏松桂,
自动化学报 , 2000,
Abstract:
一种适于异构环境的任务调度算法
支青,
自动化学报 , 2005,
Abstract: ?针对异构环境独立任务调度问题提出两个调度原则,并基于Min-min算法提出优先级最小最早完成时间算法(Prioritymin-min,PMM).该算法将任务在各处理机上执行时间的标准误差作为任务的优先级.选取最早完成时间较小的k个任务,优先调度其中优先级最高的一个.在实验基础上分析了参数$k$对PMM算法性能的影响.PMM算法克服了min-min算法单纯追求局部最优的局限性,更适合于异构环境.实验数据表明PMM算法能有效地降低调度跨度,其性能比min-min算法有明显提高.
p/t网的化简运算及其性质研究
许安国?,
软件学报 , 1997,
Abstract: 本文首先给出p/t网的几种化简运算,然后证明这几种运算对于网的结构性质不变,从而为p/t网的分析与综合提供了有效途径.
Operations for General Cartesian Multiplication of P/T Nets
Petri网的广义笛积运算

Jiang Changjun,

自动化学报 , 1993,
Abstract: Two composition methods of Petri nets had been given in 1] i.e. addition and Cartesian multiplication of p/T nets. In this paper, some operations of general Cartesian multiplication for p/T nets are given. These operations preserve the structural properties of Petri nets. An example is given to show that it is useful for the composition and analysis of P/T nets.
AN OPTIMAL ALGORITHM FOR CONVOLUTION OF TWO VECTORS WITH INTEGER ENTRIES
整数向量卷积的一个最佳算法

吴哲辉,
计算数学 , 1991,
Abstract: An algorithm for convolutions (cyclic convolutions) of two n-vectors is presented. Thisalgorithm is available for the vectors of which all entries are integers. The time complexityof this algorithm is O(n). Therefore, the algorithm presented here is optimal
Colored Petri Net-Based Deadlock Detection and Avoidance in Concurrent Operating System
并发操作系统中基于有色Petri网的死锁检测与避免

韩耀军,
计算机科学 , 2002,
Abstract: Concurrency and sharing resource of system are the main properties of concurrent operating system. Dead-lock is a important problem to solve in concurrent operating system. As a useful tool of modeling and analyzing con-current, asynchronous and distributed system ,Petri net has been used to solve many problems of operating system.However, most of the models are common Petri net. The common Petri net model is too complex when the scale ofsystem is bigger. This paper models the concurrent system with colored Petri net. It makes the model much simpler.Moreover, the paper gives an algorithm for constructing reachable marking graph of colored Petri net. As a result,the paper gives a sufficient and necessary condition for judging the system deadlock and a method for avoiding the sys-tem deadlock.
网上证券交易系统的时序Petri网描述及验证
杜玉越,
软件学报 , 2002,
Abstract: 基于时序Petri网对我国现行网上静态和动态证券交易系统进行了模拟、形式描述及功能正确性验证.应用时序逻辑推理规则,从形式上严格证明了证券交易系统需求规范及其时序Petri网模型动态行为的一致性.结果表明,时序Petri网能够清楚而简单地描述事件间的因果关系和时序关系以及并发系统中某些与时间有关的重要性质,如最终性和公平性.因此,时序Petri网可作为并发系统形式化描述和分析的有力工具.
Page 1 /77839
Display every page Item


Home
Copyright © 2008-2017 Open Access Library. All rights reserved.