<center id="y0uo8"></center>
The aim of this book is to provide the reader with a thorough grounding in the General Packet Radio Service – GPRS.The introduction contains a basic review of GSM to ensure that the reader is clear on the main aspects of circuit switched technology, as this will make the differences and advantages of packet oriented GPRS both more apparent and easier to understand.
標簽： grounding the thorough General
上傳時間： 2016-03-30
上傳用戶：康郎
student-problem-solutions 彩色圖像分割的國外著名論文
標簽： student-problem-solutions 彩色圖像分割 論文
上傳時間： 2016-04-01
上傳用戶：無聊來刷下
優化算法loqo的算法源代碼。Purpose: solves quadratic programming problem for pattern recognition for support vectors
標簽： programming recognition for quadratic
上傳時間： 2016-04-09
上傳用戶：er1219
Problem D:合唱隊形 Time Limit:1000MS Memory Limit:65536K Total Submit:1237 Accepted:437 Language: not limited Description N位同學站成一排，音樂老師要請其中的(N-K)位同學出列，使得剩下的K位同學排成合唱隊形。 合唱隊形是指這樣的一種隊形：設K位同學從左到右依次編號為1，2…，K，他們的身高分別為T1，T2，…，TK， 則他們的身高滿足T1 < T2 < ...< Ti > Ti+1 > … >TK(1<=i<=K)。 你的任務是，已知所有N位同學的身高，計算最少需要幾位同學出列，可以使得剩下的同學排成合唱隊形。 Input 輸入包含若干個測試用例。 對于每個測試用例，輸入第一行是一個整數N(2<=N<=100)，表示同學的總數。第二行有N個整數，用空格分隔，第i個整數Ti(130<=Ti<=230)是第i位同學的身高(厘米)。當輸入同學總數N為0時表示輸入結束。 Output 對于每個測試案例，輸出包括一行，這一行只包含一個整數，就是最少需要幾位同學出列。 Sample Input 8 186 186 150 200 160 130 197 220 3 150 130 140 0 Sample Output 4 1
標簽： Limit Accepted Language Problem
上傳時間： 2014-01-13
上傳用戶：aappkkee
Problem F:汽車加油 Time Limit:1000MS Memory Limit:65536K Total Submit:1400 Accepted:404 Language: not limited Description 一輛汽車加滿油后可行駛n公里。旅途中有若干個加油站。設計一個有效算法，指出應在哪些加油站?？考佑?，使沿途加油次數最少。 編程任務： 對于給定的n和k(k <= 10000)個加油站位置，編程計算最少加油次數。 Input 第一行有2 個正整數n和k，表示汽車加滿油后可行駛n公里，且旅途中有k個加油站。接下來的1 行中，有k+1 個整數，表示第k個加油站與第 k-1 個加油站之間的距離。第0 個加油站表示出發地，汽車已加滿油。第k+1 個加油站表示目的地。 Output 輸出最少加油次數。如果無法到達目的地，則輸出”No Solution”。 Sample Input 7 7 1 2 3 4 5 1 6 6 Sample Output 4
標簽： Limit Accepted Language Problem
上傳時間： 2016-04-12
上傳用戶：youth25
I built the Superlist control whilst developing an RSS reader called FeedGhost. Although there are plenty of commercial grouped list controls available I wanted to have total control over the code and of course its usability. Superlist supports drag drop column customisation, grouping as well as handling thousands of entries smoothly. It s also highly customisable if you want to change its look and feel. In this article I ll explain how to use and extend the control in a demo project. If you download the source, you can find demo project under the Tests/SuperListTest directory.
標簽： developing Superlist FeedGhost Although
上傳時間： 2016-04-15
上傳用戶：佳期如夢
北京大學ACM題 Here is a geometric problem. You have an angle and some squares in the first quadrant of the plane rectangular coordinates. The vertex of the angle is fixed on the origin O of the coordinates, and both of its radial lines are specified by the input. The sizes of the squares are also specified by the input, and the squares can shift vertically and horizontally. Now your job is to use the squares and the radial lines of the angle to enclose the maximum area, which excludes the area of the squares (see Figure 1). You should note that the edges of the squares must be parallel to the axes.
標簽： geometric quadrant problem squares
上傳時間： 2013-12-25
上傳用戶：ynzfm
LSVMK Langrangian Support Vector Machine algorithm LSVMK solves a support vector machine problem using an iterative algorithm inspired by an augmented Lagrangian formulation.
標簽： LSVMK Langrangian algorithm Support
上傳時間： 2016-04-28
上傳用戶：tfyt
遺傳算法和“貨郎擔” 問題: "The traveling salesman problem, or TSP for short, is this: given a finite number of cities along with the cost of travel between each pair of them, find the cheapest way of visiting all the cities and returning to your starting point."
標簽： traveling salesman problem finite
上傳時間： 2013-12-24
上傳用戶：watch100
Traveling Salesman Problem Java Genetic Algorithm Solution, Hope all enjoy it.
標簽： Traveling Algorithm Salesman Solution
上傳時間： 2013-12-20
上傳用戶：sz_hjbf
