搜索结果

最优服务次序问题 问题描述: 设有n 个顾客同时等待一项服务。顾客i需要的服务时间为t(i),i=1,…,n 。...个顾客等待服务时间的 总和除以n。 编程任务: 对于给定的n个顾客需要的服务时间,编程计算最优服务次序。

Linux设备驱动编程之内存与I/O操作

The LZW compression class i mplemented as a fixed length code which you can specify, the huffman algorithm implementation encodes a byte into a variable length bit array. Both of them can work with streams

用51单片机实现数字钟 利用数码管、I/O口实现数字钟的计数功能，并显示在数码管上

给定n个小区之间的交通图。若小区i与小区j之间有路可通，则将顶点i与顶点j之间用边连接，边上的权值 表示这条道路的长度。现在打算在这n个小区中选定一个小区建一所医院。试问这家医院应建在哪个小区，才能使距离医院最远的小区到医院的路程最短？请设计一个算法求解上述问题。 ...

同时读取ISO15693(I CODE II,My-D卡)16张卡的硬件接口C程序，用的是单片机51系列

1-wire总线的开发，用一根线，可以实现同类的功能

基于OFDM的无线宽带系统仿真It contains mainly two parts, i.e. link-level simulator and system-level simulator. Link-level simulator focus on a single-cell single-user scenario, where signal is transmitted from tx, and estimated at rx. Comparing the difference in tx/rx signal, the error rate can be f ...

someproceduceaboutTDOA,i hope it can help you!

The PCI Local bus concept was developed to break the PC data I/O bottleneck and clearly opens the door to increasing system speed and expansion capabilities. The PCI Local bus moves high speed peripherals from the I/O bus and places them closer to the system’s processor bus, providing faster data t ...