« 問題描述: 假設要在足夠多的會場里安排一批活動
« 問題描述: 假設要在足夠多的會場里安排一批活動,并希望使用盡可能少的會場。設計一個有效的 貪心算法進行安排。(這個問題實際上是著名的圖著色問題。若將每一個活動作為圖的一個 頂點,不...
« 問題描述: 假設要在足夠多的會場里安排一批活動,并希望使用盡可能少的會場。設計一個有效的 貪心算法進行安排。(這個問題實際上是著名的圖著色問題。若將每一個活動作為圖的一個 頂點,不...
ICP fit points in data to the points in model. Fit with respect to minimize the sum of square errors...
% because we do not truncate and shift the convolved input % sequence, the delay of the desired out...
This example streams input from a ADC source to a DAC. An analog signal is acquired block-by-block ...
最大流,The programs are designed to run under BSD UNIX. All programs read from the standard input and ...
This program demonstrates operation of ADC0 in polled mode. The ADC0 is // configured to use writes...
This program demonstrates operation of ADC0 in polled mode. The ADC0 is // configured to use writes...
This directory contains the memtest 8051 firmware for the Anchor Chips EZ-USB chip. The purpose...
We have a group of N items (represented by integers from 1 to N), and we know that there is some tot...
EPS_Java Projec is JAVA program can display charts, and handle waypoints, track, and routes. It read...