搜索资源列表
Einstein_speech
- 人类精神智慧的精华，在你绝望的时候，在你懈怠的时候，给予你强大的力量-The essence of the wisdom of the human spirit, in your time of despair, before you slack time give you powerful
Simplex
- 线性规划中的单纯形法，单纯形法是求解线性规划的最主要方法，程序首先确定初始可行解，如没有找到，则引入人工变量或松弛变量来求解-Of linear programming simplex method, simplex method for solving linear programming are the most important methods, procedures to determine first of all, the
slack
- 定制缓存的生命周期，可以添加缓存，删除缓存中的对象，可以对任何对象设置它的生命周期，对象可以是任何类型的。在其他开发的时候可以直接掉来用，单独的一个线程。-Has custom-made buffer the life cycle, may increase the buffer, deletes in the buffer the object, may establish its life cycle to any object,
LLFScheduling
- 最小松弛度优先算法，属于实时调度算法，又叫最小欲度（空闲时间）优先算法，在这里，给出了其C++的代码实现。-Minimum slack priority algorithm, belonging to real-time scheduling algorithm, also known as For the smallest degrees (idle time) priority algorithms, in here, given
STUDENTS_SCORE
- Specifications 1. Top module name :SS (File name : SS.v) 2. Input pins: CLK, RESET, IN_VALID, INPUT [6:0] - 2 - 3. Output pins: OUT_VALID, OUTPUT [6:0] 4. Synchronous active high RESET is used, and no latch des
Least-Slack-Time.tar
- It is written in C programming language. Problem: Building and simulating a Least-Slack-Time scheduler using linked list and stack data structures Descr iption: In time shared systems, tasks submitted to the system a
incircle
- The INCIRCLE code formulates the problem as an LP with slack variables
slack
- 基于DVS的多核周期任务调度，在任务队列分配时采用最大空闲时间预分配策略，任务的第三步空闲时间回收的策略-Pre-allocation strategy based DVS the multicore cycle task scheduling, task queue allocation maximum idle time, the third step of the task idle time recovery strategy
hw4problem2
- 一种用Newton-Rapson Method来计算能量的Matlab code-Newton-Rapson Method to determine the slack bus power( 3 buses)/
penalty_factor
- calculating penalty factor for slack bus
hostfs_user
- Enable "slack" in the AML interpreter for Linux.
24782
- Material Requirement Planning is a dependent demand system that calculates materials requirements and production plans to satisfy known and forecast sales orders. It helps to make volume and timing calculations based on
scsi_proc
- 4K page size, but our output routines, use some slack for overruns.
Bellman-Ford-queue-optimization
- Bellman-Ford算法关键之处在于：只有那些在前一遍松弛中改变了最短路程估计值的顶点，才能引起它们邻接点最短路程估计值发生改变。-Bellman-Ford algorithm that crucial point: Only those former slack again changed the vertex shortest distance estimates, causing their neighbors to the
Least-Slack-Time-Code
- Least Slack Time Code Java code
ccr-as-rows-are-DMU-in-p-model
- 计算数据包络分析中的ccr和bcc模型决策单元的效率值松弛变量的值等-calculate the efficiency and slack of ccr and bcc model in matlab
CVS_Carbon
- 功能是在有潮流约束，碳排放约束，电压和无功约束等条件下的发电权交易模型，采用基于约束松弛变量策略的中心校正内点法求解-There is a trend in the function generation right transaction model under conditions of constraint, carbon constraints, voltage and reactive power constraints, u
Perceptron
- 本实验的目的是学习和掌握两种感知器算法：批处理感知器算法和批处理裕量松弛 算法。感知器算法是通过学习两类已标记的样本，建立一个线性分类器。学习的过程就是求解感知器权系数的过程，人们通过建立一个准则函数J(a),将求解感知器权系数的问题简化为一个标量函数J(a)的极小化问题，即当a为解向量时，J(a)最小。而极小化问题常用梯度下降法来解决。本实验给出了基于梯度下降法的两种感知器算法，介绍了原理并编程实现，最后对两种算法的特点加以比较分
SlackBackup_1-1
- Slack backup source code for use with legacy tokens
slack export downloader
- slack export file downloder