solve readers-writers problem with RMI
标签： readers-writers problem solve with
上传时间： 2014-01-10
上传用户：远远ssad
硬盘维修的绝密资料_harddisk fixed is no problem.
上传时间： 2014-06-09
上传用户：gxf2016
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
