Traveling Salesman Problem (TSP) has been an interesting problem for a Long time in classical optimization techniques which are based on linear and nonlinear programming. TSP can be described as follows: Given a number of cities to visit and their distances from all other cities know, an optimal travel route has to be found so that each city is visited one and only once with the least possible distance traveled. This is a simple problem with handful of cities but becomes complicated as the number increases.
標簽： interesting Traveling classical Salesman
上傳時間： 2016-02-06
上傳用戶：rocwangdp
Just what is a regular expression, anyway? Take the tutorial to get the Long answer. The short answer is that a regular expression is a compact way of describing complex patterns in texts. You can use them to search for patterns and, once found, to modify the patterns in complex ways. You can also use them to launch programmatic actions that depend on patterns. A tongue-in-cheek comment by programmers is worth thinking about: "Sometimes you have a programming problem and it seems like the best solution is to use regular expressions now you have two problems." Regular expressions are amazingly powerful and deeply expressive. That is the very reason writing them is just as error-prone as writing any other complex programming code. It is always better to solve a genuinely simple problem in a simple way when you go beyond simple, think about regular expressions. Tutorial: Using regular expressions
標簽： expression the tutorial regular
上傳時間： 2013-12-19
上傳用戶：sardinescn
編程題（15_01.c） 結構 struct student { Long num char name[20] int score struct student *next } 鏈表練習： (1).編寫函數struct student * creat(int n),創建一個按學號升序排列的新鏈表,每個鏈表中的結點中 的學號、成績由鍵盤輸入，一共n個節點。 (2).編寫函數void print(struct student *head),輸出鏈表，格式每行一個結點，包括學號，姓名,分數。 (3).編寫函數struct student * merge(struct student *a,struct student *b), 將已知的a,b兩個鏈表 按學號升序合并，若學號相同則保留成績高的結點。 (4).編寫函數struct student * del(struct student *a,struct student *b),從a鏈表中刪除b鏈表中有 相同學號的那些結點。 (5).編寫main函數，調用函數creat建立2個鏈表a,b,用print輸出倆個鏈表；調用函數merge升序合并2個 鏈表，并輸出結果；調用函數del實現a-b,并輸出結果。 a: 20304,xxxx,75, 20311,yyyy,89 20303,zzzz,62 20307,aaaa,87 20320,bbbb,79 b： 20302,dddd,65 20301,cccc,99 20311,yyyy,87 20323,kkkk,88 20307,aaaa,92 20322,pppp,83
上傳時間： 2016-04-13
上傳用戶：zxc23456789
堆棧的數據結構和操作 ypedef struct{ HGLOBAL hMem //堆棧全局內存句柄 POINT *lpMyStack //指向該句柄的指針 Long ElementsNum //堆棧的大小 Long ptr //指向棧頂得指針
標簽： ElementsNum lpMyStack HGLOBAL ypedef
上傳時間： 2013-11-26
上傳用戶：15736969615
//按柱面和磁道來讀取磁盤數據,要求 Public Function ReadDisk(ByVal Cylinders As Long, ByVal Tracks As Long, db() As Byte) As Boolean
標簽： ByVal Long Cylinders Function
上傳時間： 2014-01-13
上傳用戶：zxc23456789
用AVR單片機設計的MP3播放器 功能： MP3 Player IDE ATA interface FAT 32 with Long file name support USB interface On board power supply (input from 7v to 20v DC) Bootloader firmware upgradeable via USB port Infrared bi-directional interface Remote Control Back light graphic LCD worked with only 2x AA batteries In sleep mode sink less than 1uA (2.5mA in active mode) 5 buttons for easy navigation Long range (more than 20 feets)
標簽： MP3 interface support Player
上傳時間： 2016-07-02
上傳用戶：fandeshun
Advanced UNIX Programming is the Long-awaited (19 years!) update to the 1985 original. Maybe "update" isn t the right word--of the 750-or-so pages in the new book, there are maybe two dozen paragraphs that are unchanged. The original covered about 70 system calls, and the new one covers about 300. （這是Advanced UNIX Programming的附書源碼）
標簽： update Long-awaited Programming the
上傳時間： 2013-12-19
上傳用戶：xiaoxiang
C-package of "Long Short-Term Memory" for Protein classification
標簽： classification Short-Term C-package Protein
上傳時間： 2014-01-24
上傳用戶：www240697738
編寫具有如下原型的函數：int f(unsigned Long x, int n, int& Lxn) 它負責將整數x的第n位（從左邊數第n位，n>0）的數值放到引用Lxn之中（將作為結果返回到主調函數的對應實參變量中），并將倒數第n位（從右邊數第n位，n>0）的數值作為函數結果返回去。并編制主函數對它進行調用以驗證其正確性。 例如，當x=123456789，n=7時，執行語句“Rxn=f(x, n, Lxn) ”將使返回的Lxn為7，并使Rxn變為3；而執行語句“Rxn=f(12345, 6, Lxn) ”將使Lxn與Rxn都變為為0（超出數的“長度”即總位數時返回0）。
上傳時間： 2017-01-02
上傳用戶：s363994250
* 函數名稱： * Fourier() * 參數: * LPSTR lpDIBBits - 指向源DIB圖像指針 * Long lWidth - 源圖像寬度（象素數） * Long lHeight - 源圖像高度（象素數） * 返回值: * BOOL - 成功返回TRUE，否則返回FALSE。 * 說明: * 該函數用來對圖像進行付立葉變換。
標簽： Long lpDIBBits Fourier lWidth
上傳時間： 2014-01-24
上傳用戶：fxf126@126.com
