Search - pipeline

Search - pipeline - List

[Other] kwic DL : 1: kwic(keyword in context)系统演示源代码及文档，基于pipeline-filter模式，.net平台编写。-kwic (keyword in context) system demonstration source code and documents, based on pipeline-filter pattern, net platform compilation.
Date : 2008-10-13 Size : 409.51kb User : 郭
[Other] 3_3流水线 DL : 0: 流水线作业练习，A、B机器处理作业1～5所需要的时间分别是『。。。。』『。。。。』，一台机器一次只能处理一个作业，一个作业只能由一台机器完成，求A、B完成所有作业的最短时间。-pipeline workbook, A, B machines handling a ~ 5 respectively, the time required is . . . . ]. . . . And one machine can handle only one time operation, an operation only by the completion of a machine, for A, B complete all work is the shortest time.
Date : 2008-10-13 Size : 1.15kb User : 刘约靖
[Other] 流水线作业调度 DL : 0: 按动态规划原理球解一类特定条件下的流水线调度问题的具体做法-according to the principles of dynamic programming ball a particular type of solution under the conditions of the pipeline scheduling problems, the specific way
Date : 2008-10-13 Size : 7.21kb User : 子非鱼
[Other] NamePipe DL : 0: 自己封装的管道通信类，可简单修改后用于需要管道技术的程序中，并附带测试程序。-own package Pipeline Communications, simple modifications necessary for the pipeline technical procedures, test procedures and fringe.
Date : 2008-10-13 Size : 103.89kb User : 王文明
[Other] lsxarrange DL : 0: 完成流水线安排问题的解决，具体问题描述如下：有m台不同的机器，n个不同的工件。每个工件有多道工序，每道工序由指定的机器在固定的时间内完成。一道工序一旦开始处理，就不能中断。每台机器一次只能处理一道工序。一个调度就是决定每台机器上工序的处理顺序，使得机器完成所有工件的时间最短。具体的，该问题就是要求在满足（1）、（2）两个约束条件的前提下，确定每台机器上工序的顺序，使加工的时间跨度（从开始加工到全部工件都加工完所需要的时间）达到最小。其中，（1）表示工件约束条件：对每个工件而言，机器对它的加工路线是事先确定的；（2）表示机器约束条件：对每台机器而言，一次只能对一道工序进行加工。解决方案用图形界面画出。-pipeline completed arrangements for the settlement of this problem, the specific issues described as follows : m Taiwan different machines, n different workpiece. Each have a process workpiece, and each procedure specified by the machine at a fixed time. Once a process started, it can not be interrupted. Each machine can handle only one a process. Scheduling is a decision each machine processes the order processing, machinery parts to complete all the shortest time. Specific, the issue is meeting the requirements of (1), (2) 2 binding conditions on the premise that identify each machine processes the order, so that the processing time span (from the beginning of the processing of all parts are needed to complete the processing time) to achieve the smallest. Which, (a) the workpiece constra
Date : 2008-10-13 Size : 404.43kb User : 荣平
[Other] liushuixian DL : 0: 一个简单的算法设计程序，用C++编写，实现流水线的调度。-a simple algorithm design process, using C, the realization of the pipeline scheduling.
Date : 2008-10-13 Size : 11.37kb User : 映雪