搜索结果
找到约 23 项符合
Directed 的查询结果
按分类筛选
Java编程 Exploring C++ uses a series of self–directed lessons to divide C++ into bite–sized chunks that you c
Exploring C++ uses a series of self–directed lessons to divide C++ into bite–sized chunks that you can digest as rapidly as you can swallow them. The book assumes only a basic understanding of fundamental programming concepts (variables, functions, expressions, statements) and requires no prior kn ...
数据结构 I implement Dijkstra s Single Source Shortest Path, say SSP, algorithm for directed graphs using a s
I implement Dijkstra s Single Source Shortest Path, say SSP, algorithm for directed graphs using a simple data structure, say simple scheme, Fibonacci heaps, say F-heap scheme, and Pairing heaps, say P-heap scheme, and measure the relative performance of the three implementations.
ARM LPC1300系列产品勘误数据手册
On the LPC13xx, programming, erasure and re-programming of the on-chip flash can be performed using In-System Programming (ISP) via the UART serial port, and also, can be performed using In-Application Programming (IAP) calls directed by the end-user code. For In-System Programming (ISP) via the UAR ...
人工智能/神经网络 LVQ学习矢量化算法源程序 This directory contains code implementing the Learning vector quantization network.
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 ...
人工智能/神经网络 Hidden_Markov_model_for_automatic_speech_recognition This code implements in C++ a basic left-right
Hidden_Markov_model_for_automatic_speech_recognition
This code implements in C++ a basic left-right hidden Markov model
and corresponding Baum-Welch (ML) training algorithm. It is meant as
an example of the HMM algorithms described by L.Rabiner (1) and
others. Serious students are directed to the so ...
人工智能/神经网络 This directory contains code implementing the K-means algorithm. Source code may be found in KMEANS
This directory contains code implementing the K-means algorithm. Source code
may be found in KMEANS.CPP. Sample data isfound in KM2.DAT. The KMEANS
program accepts input consisting of vectors and calculates the given
number of cluster centers using the K-means algorithm. Output is
directed to the sc ...
人工智能/神经网络 k-meansy算法源代码。This directory contains code implementing the K-means algorithm. Source code may be f
k-meansy算法源代码。This directory contains code implementing the K-means algorithm. Source code
may be found in KMEANS.CPP. Sample data isfound in KM2.DAT. The KMEANS
program accepts input consisting of vectors and calculates the given
number of cluster centers using the K-means algorithm. Output i ...
其他书籍 輕易學好C++編程技巧 - 進楷 (香港科技大學筆記 19課) 內容包括 1) base C++ review, 2) Pointers and Dynamic Objects, 3) R
輕易學好C++編程技巧 - 進楷 (香港科技大學筆記 19課) 內容包括
1) base C++ review,
2) Pointers and Dynamic Objects,
3) Recursion,Linked Lists,
4) Stacks and Queues,
5) Algorithm Analysis,
6) Insertion Sort and Mergesort,
7) Quicksort,
8) Heaps and Heapsort,
9) Lower Bound of Sorting and Radix Sort,
...
其他书籍 Recent advances in experimental methods have resulted in the generation of enormous volumes of data
Recent advances in experimental methods have resulted in the generation
of enormous volumes of data across the life sciences. Hence clustering and
classification techniques that were once predominantly the domain of ecologists
are now being used more widely. This book provides an overview of these
i ...
编译器/解释器 c pgm to find redundant paths in a graph.Many fault-tolerant network algorithms rely on an underlyin
c pgm to find redundant paths in a graph.Many fault-tolerant network algorithms rely on an underlying assumption that there are possibly distinct network paths between a source-destination pair. Given a directed graph as input, write a program that uses depth-first search to determine all such paths ...