LVQ学习矢量化算法源程序
This directory contains code implementing the Learning vector quantization
network. Source code may be found in LVQ.CPP. Sample training data is found
in LVQ1.PAT. Sample test data is found in LVQTEST1.TST and LVQTEST2.TST. The
LVQ program accepts input consisting of vectors ...
a3load is 8051 firmware that can be used for uploading or downloading
to EZ-USB RAM (internal or external). It implements the vendor specific
command bRequest = 0xA3. The address to download/upload to/from is
specified in the wValue field of the SETUP packet and the length of
the transfer in the wL ...
This program is using Genetic Algorithm to solve the Travlling
Salesman Problem. It gives the best path route within a specified
time.
usage: java Evolver <seconds> <city file> <config file>
Author: Liu Yang
xletview, for UNIX file and directory names are case sensitive. The path to the project CVSROOT must be specified using lowercase characters (i.e. /cvsroot/xletview)
PCI-to-PCI Bridge Architecture Specification Revision 1.1
This specification establishes the requirements that a PCI-to-PCI bridge must meet to be compliant to this specification and the PCI Local Bus Specification. In addition, the requirements for optional extensions are specified. This specific ...
The code, images and designs for this book are released under a Creative Commons Attribution-NonCommercial-ShareAlike 2.5 License.
http://creativecommons.org/licenses/by-nc-sa/2.5/
You are free:
* to copy, distribute, display, and perform the work
* to make derivative works
Under the following c ...
NXP示例编码集,Software that is described herein is for illustrative purposes only which
provides customers with programming information regarding the products.
This software is supplied "AS IS" without any warranties. NXP Semiconductors
assumes no responsibility or liability for the use of the sof ...
this m file can Find a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for the shortest path (least distance needed to travel to each city exactly once)
Notes:
1. Input error checking included
2. Inputs can be specified in any order, s ...
