16 x 16 LED problem for display use can run dynamically
標(biāo)簽： dynamically problem display 16
上傳時間： 2015-10-30
上傳用戶：許小華
The Josephu wreath problem solves
標(biāo)簽： Josephu problem wreath solves
上傳時間： 2013-12-20
上傳用戶：nanshan
2003ACM國際大學(xué)生程序設(shè)計大賽亞洲預(yù)賽廣州賽區(qū)競賽題目problem.
上傳時間： 2015-11-15
上傳用戶：zhichenglu
A Genetic Algorithms and the Traveling Salesman Problem
標(biāo)簽： 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.
標(biāo)簽： 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.
標(biāo)簽： priority preemptive inversion problem
上傳時間： 2015-12-14
上傳用戶：氣溫達(dá)上千萬的
Inverse Problem Theory
標(biāo)簽： 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)
標(biāo)簽： Traveling Salesman solution Problem
上傳時間： 2013-12-04
上傳用戶：從此走出陰霾
Using Ant Colony Optimization Algorithm to solve Traveling Salesman Problem.對此方面的研究很有幫助
標(biāo)簽： Optimization Algorithm Traveling Salesman
上傳時間： 2014-01-12
上傳用戶：集美慧
This a journal paper on the optimization of Max Connection problem in a telecommunication optical network.
標(biāo)簽： telecommunication optimization Connection journal
上傳時間： 2015-12-27
上傳用戶：xaijhqx
蟲蟲下載站版權(quán)所有 京ICP備2021023401號-1
