.数据结构 假设有M个进程N类资源
.数据结构 假设有M个进程N类资源,则有如下数据结构: MAX[M*N] M个进程对N类资源的最大需求量 AVAILABLE[N] 系统可用资源数 ALLOCATION[M*N] M个...
.数据结构 假设有M个进程N类资源,则有如下数据结构: MAX[M*N] M个进程对N类资源的最大需求量 AVAILABLE[N] 系统可用资源数 ALLOCATION[M*N] M个...
数据结构 假设有M个进程N类资源,则有如下数据结构: MAX[M*N] M个进程对N类资源的最大需求量 AVAILABLE[N] 系统可用资源数 ALLOCATION[M*N] M个进...
aPLib is a 32-bit compression library based on the compression algorithm used in aPACK (my executa...
The module LSQ is for unconstrained linear least-squares fitting. It is based upon Applied Statisti...
A C++ N-grams Package 2.0 This is a simple C++ n-grams package that includes a header, the correspo...
Copyright Copyright © 2004 O Reilly Media, Inc. Printed in the United States of America. ...
YSS915 (KP2V2) is an LSI for processing Karaoke voice signals. This LSI has an A/D converter (1 cha...
A series of .c and .m files which allow one to perform univariate and bivariate wavelet analysis of ...
Person-to-person realtime IP communications, like presence, VoIP and video applications, offer clea...
MIB Browser allows you to view the hierarchy of SNMP MIB variables in the form of a tree and provide...