asm-for-lpc

UART I/O and Memory Allocation Example for GNU The project GNU_IODemo shows how to use memory alloc

UART I/O and Memory Allocation Example for GNU The project GNU_IODemo shows how to use memory allocation routines (malloc) and char I/O (printf, scanf) via a serial interface with the GNU toolchain. The I/O functions are adapted for the Analog Devices ADuC7000 series using the SERIAL.C module. The example also shows the efficiency of the Keil CA ARM Compiler run-time library which is tuned for single chip systems.

标签： Allocation GNU_IODemo Example project

上传时间： 2015-05-04

上传用户：Amygdala
PWM Example for Philips LPC2

PWM Example for Philips LPC2

标签： Example Philips LPC2 PWM

上传时间： 2013-12-24

上传用户：sardinescn
For WorkBench2.31 的pentium4 BSP

For WorkBench2.31 的pentium4 BSP，应该也可以在其他的Pentium机上运行。

标签： WorkBench pentium4 2.31 For

上传时间： 2014-01-12

上传用户：Altman
IAR EW for ARM v4.30 include keygen

IAR EW for ARM v4.30 include keygen

标签： include keygen 4.30 IAR

上传时间： 2015-05-04

上传用户：源码3
[書籍] Microsoft SQL Server 2005 Reporting Services For Dummies 書籍名稱：Microsoft SQL Server 2005 Repo

[書籍] Microsoft SQL Server 2005 Reporting Services For Dummies 書籍名稱：Microsoft SQL Server 2005 Reporting Services For Dummies 出版社　：Wiley 作者　　：Mark Robinson 書籍語言：English 書籍類型：教學 - 軟件教學檔案格式：PDF 檔案大小：7.75MB 發行日期：December 2005

标签： Microsoft Server 2005 SQL

上传时间： 2015-05-04

上传用户：小鹏
busybox1.0 for linux from internet.

busybox1.0 for linux from internet.

标签： internet busybox linux from

上传时间： 2015-05-04

上传用户：erkuizhang
gdb for adsp develop

gdb for adsp develop

标签： develop adsp gdb for

上传时间： 2013-12-21

上传用户：璇珠官人
usb-com for sms 自己开发的类可以借鉴下

usb-com for sms 自己开发的类可以借鉴下

标签： usb-com for sms

上传时间： 2015-05-04

上传用户：秦莞尔w
Routines for Writing Device Drivers.

Routines for Writing Device Drivers.

标签： Routines Drivers Writing Device

上传时间： 2015-05-05

上传用户：杜莹12345
For the incomplete methods, we kept the representation of the queens by a table and the method of ca

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.

标签： the representation incomplete methods

上传时间： 2015-05-05

上传用户：1159797854