CGAL is a collaborative effort of several sites in Europe and Israel. The goal is to make the most important of the solutions and methods developed in computational geometry available to users in industry and academia in a C++ library.
標簽： collaborative several Europe Israel
上傳時間： 2015-04-10
上傳用戶：hopy
graspForth is my humble attempt at a Forth-in-C that has the following goals: GCC ......... to support all 32-bit micros that GCC cross-compiles to. Relocatable . to be able to run in-place in either Flash or Ram. Fast ........ to be "not much" slower than an assembly based native Forth. Small ....... to fit-in approx 300 words in less than 25Kbytes on a 32-bit machine. Portable .... to achieve a 5 minute port to a new 32bit micro-processor, or micro-controller.
標簽： graspForth Forth-in-C following attempt
上傳時間： 2015-05-23
上傳用戶：tfyt
LCS（最長公共子序列）問題可以簡單地描述如下： 一個給定序列的子序列是在該序列中刪去若干元素后得到的序列。給定兩個序列X和Y，當另一序列Z既是X的子序列又是Y的子序列時，稱Z是序列X和Y的公共子序列。例如，若X={A，B，C，B，D，B，A}，Y={B，D，C，A，B，A}，則序列{B，C，A}是X和Y的一個公共子序列，但它不是X和Y的一個最長公共子序列。序列{B，C，B，A}也是X和Y的一個公共子序列，它的長度為4，而且它是X和Y的一個最長公共子序列，因為X和Y沒有長度大于4的公共子序列。 最長公共子序列問題就是給定兩個序列X={x1,x2,...xm}和Y={y1,y2,...yn}，找出X和Y的一個最長公共子序列。對于這個問題比較容易想到的算法是窮舉，對X的所有子序列，檢查它是否也是Y的子序列，從而確定它是否為X和Y的公共子序列，并且在檢查過程中記錄最長的公共子序列。X的所有子序列都檢查過后即可求出X和Y的最長公共子序列。X的每個子序列相應于下標集{1,2,...,m}的一個子集。因此，共有2^m個不同子序列，從而窮舉搜索法需要指數時間。
上傳時間： 2015-06-09
上傳用戶：氣溫達上千萬的
c語言版的多項式曲線擬合。 用最小二乘法進行曲線擬合. 用p－1 次多項式進行擬合，p<= 10 x,y 的第0個域x[0],y[0],沒有用，有效數據從x[1],y[1] 開始 nNodeNum,有效數據節點的個數。 b,為輸出的多項式系數，b[i] 為b[i-1]次項。b[0],沒有用。 b,有10個元素ok。
上傳時間： 2014-01-12
上傳用戶：變形金剛
高精度乘法基本思想和加法一樣。其基本流程如下： ①讀入被乘數s1，乘數s2 ②把s1、s2分成4位一段，轉成數值存在數組a,b中；記下a,b的長度k1,k2； ③i賦為b中的最低位； ④從b中取出第i位與a相乘，累加到另一數組c中；（注意：累加時錯開的位數應是多少位 ？） ⑤i:=i-1；檢測i值：小于k2則轉⑥,否則轉④ ⑥打印結果
上傳時間： 2015-08-16
上傳用戶：源弋弋
Listed below are the typographical conventions used in this guide. – Example C++ code and commands to be typed by the user are in non-bold characters in typewriter font. – Items where the user has to supply a name or number are given in lower-case italic characters in typewriter font. – Sections marked with a ‡ describe features that are also available in ANSI C.
標簽： typographical conventions commands Example
上傳時間： 2013-12-20
上傳用戶：xiaoxiang
The initial planning and thinking about this book began during a discussion of SQL Server futures in July 2001. The discussion was with Rob Howard during a trip to Microsoft to discuss the first book I was working on at that time. After that, I stayed involved in what was happening in ADO.NET by going to the SQL Server Yukon Technical Preview in Bellevue, Washington, in February 2002 and by working with the ASP.NET and SQL Server teams at Microsoft since July 2003.
標簽： discussion planning thinking initial
上傳時間： 2014-01-08
上傳用戶：cjf0304
Using Gaussian elimination to solve linear equations. // In this version, we allow matrix of any size. This is done by treating // the name of a 2-dimensional array as pointer to the beginning of the // array. This makes use of the fact that arrays in C are stored in // row-major order.
標簽： elimination equations Gaussian version
上傳時間： 2016-02-14
上傳用戶：hxy200501
分數是兩個整數的比，通常表示為 (或b/a)的形式，其中b稱為分子，a稱為分母，分母不能為0。分數在計算機中以整數或浮點數（有限小數）的形式表示，大多數情況下都是近似表示，具有較大的誤差，例如 ，在計算機中用整數表示為0，用浮點數表示為0.333333。本實例就是要設計一個Fraction (分數) 類類型，該類型的對象可以像基本類型數據一樣進行運算，結果仍為分數，運算包括四則運算，關系運算，及求一元一次分式方程的解，輸入輸出要求按分數方式進行。
上傳時間： 2016-02-18
上傳用戶：zhoujunzhen
This document represents the first stage in a process of taking the National Strategy for Police Information Systems (NSPIS) forward. It defines the mechanisms to ensure that we (and our partners) have access to the right information, in the right form, in the right time at an appropriate cost. The Strategy will ensure the Police Service has a collective understanding of the value of information and that we are able to exploit National Information Assets in support of local policing.
標簽： represents the National Strategy
上傳時間： 2016-03-08
上傳用戶：wangdean1101
