Philips LPC22xx A/D Example Program
標(biāo)簽： Philips Example Program LPC
上傳時(shí)間： 2014-01-09
上傳用戶：王者A
Philips LPC21xx A/D Example Program
標(biāo)簽： Philips Example Program LPC
上傳時(shí)間： 2013-12-20
上傳用戶：zxc23456789
A real-time serial port device driver, works with RT-Linux and RTAI.
標(biāo)簽： real-time RT-Linux device driver
上傳時(shí)間： 2015-05-04
上傳用戶：kbnswdifs
Linphone is a web phone: it let you phone to your friends anywhere in the whole world, freely, simply by using the internet. The cost of the phone call is the cost that you spend connected to the internet.
標(biāo)簽： phone Linphone anywhere friends
上傳時(shí)間： 2015-05-04
上傳用戶：牛布牛
a program can convert binary to ASC and ASC to binary
標(biāo)簽： binary ASC program convert
上傳時(shí)間： 2015-05-05
上傳用戶：kbnswdifs
Deleting a node of RB-Tree without recurrence
標(biāo)簽： recurrence Deleting RB-Tree without
上傳時(shí)間： 2015-05-05
上傳用戶：yuzsu
TLC0831A8位A/D轉(zhuǎn)換器(C語(yǔ)言驅(qū)動(dòng)程序)
上傳時(shí)間： 2014-11-17
上傳用戶：gundan
msp430單片機(jī)比較器A程序 ，很好呀，已經(jīng)通過(guò)驗(yàn)證了！
上傳時(shí)間： 2014-12-22
上傳用戶：caixiaoxu26
For the incomplete methods, we kept the representation of the queens by a table and the method of calculation to determine if two queens are in conflict, which is much faster for this kind of problems than the representation by a matrix. heuristics: descent. Tests: 100 queens in less than 1 second and 67 iterations. 500 queens in 1 second and 257 iterations. 1000 queens in 11 seconds and 492 iterations. heuristics: Simulated annealing. Tests: 100 queens in less than 1 second and 47 iterations. 500 queens in 5 seconds and 243 iterations. 1000 queens in 13 seconds and 497 iterations. heuristics: based on Simulated Annealing. Tests: 100 queens in less than 1 second and 60 iterations. 500 queens in 1 second and 224 iterations. 1000 queens in 5 seconds and 459 iterations. 10 000 queens in 20 minutes 30 seconds and 4885 iterations.
標(biāo)簽： the representation incomplete methods
上傳時(shí)間： 2015-05-05
上傳用戶：1159797854
The program SPLAY is a pascal to C translation of a program that Kim Kokkonen wrote in Turbo Pascal to implement Splay Trees. This program compresses and decompresses files, and does a pretty good job of it. Contents: SPLAY.PAS Original TP source code SPLAY.C Translation of code to C SPLAY.EXE Compiled version of SPLAY.C (small model) README.DOC You are looking at it Read the comments at the beginning of SPLAY.C for more info.
標(biāo)簽： program translation Kokkonen pascal
上傳時(shí)間： 2015-05-05
上傳用戶：rocwangdp
蟲(chóng)蟲(chóng)下載站版權(quán)所有 京ICP備2021023401號(hào)-1
<strike id="ye0ig"></strike>
<center id="ye0ig"></center>