16 x 16 LED problem for display use can run dynamically
标签： dynamically problem display 16
上传时间： 2015-10-30
上传用户：许小华
The Josephu wreath problem solves
标签： Josephu problem wreath solves
上传时间： 2013-12-20
上传用户：nanshan
2003ACM国际大学生程序设计大赛亚洲预赛广州赛区竞赛题目problem.
上传时间： 2015-11-15
上传用户：zhichenglu
A Genetic Algorithms and the Traveling Salesman Problem
标签： Algorithms Traveling Salesman Genetic
上传时间： 2015-11-27
上传用户：cccole0605
The present paper deals with the problem of calculating mean delays in polling systems with either exhaustive or gated service. We develop a mean value analysis (MVA) to compute these delay figures. The merits of MVA are in its intrinsic simplicity and its intuitively appealing derivation. As a consequence, MVA may be applied, both in an exact and approximate manner, to a large variety of models.
标签： with calculating present polling
上传时间： 2014-11-17
上传用户：kelimu
In a preemptive priority based RTOS, priority inversion problem is among the major sources of deadline violations. Priority inheritance protocol is one of the approaches to reduce priority inversion. Unfortunately, RTOS like uC/OS can’t support priority inheritance protocol since it does not allow kernel to have multiple tasks at the same priority. Although it has different ways to avoid priority inversion such as priority ceiling protocol, developers still have some difficulties in programming real time applications with it. In this paper, we redesign the uC/OS kernel to provide the ability to support round robin scheduling and implement priority inheritance semaphore on the modified kernel. As result, we port new kernel with priority inheritance semaphore to evaluation board, and evaluate the execution time of each of the kernel service as well as verify the operations of our implementation.
标签： priority preemptive inversion problem
上传时间： 2015-12-14
上传用户：气温达上千万的
Inverse Problem Theory
上传时间： 2013-12-21
上传用户：牛布牛
Finds a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for the shortest path (least distance needed to travel to each city exactly once)
标签： Traveling Salesman solution Problem
上传时间： 2013-12-04
上传用户：从此走出阴霾
Using Ant Colony Optimization Algorithm to solve Traveling Salesman Problem.对此方面的研究很有帮助
标签： Optimization Algorithm Traveling Salesman
上传时间： 2014-01-12
上传用户：集美慧
This a journal paper on the optimization of Max Connection problem in a telecommunication optical network.
标签： telecommunication optimization Connection journal
上传时间： 2015-12-27
上传用户：xaijhqx
