the scheduling problems are the non-polynomial problems-hard (np-hard), is to solve it, and meta-heuristic innovative method compared with the exact method require less time and memory.in this research, developed imperialistic competitive algorithm used to solving the single-mode resource-constrained project scheduling problem.also the basic feasible solution algorithm used in order to increase...

This paper explores the possibility that the production and consumption of Fela as a radical, third-world cultural and political figure is coupled with his presentation as radically polygynous and misogynist in ways that allow him to be fit into the existing discourses of race and gender in the West by both mainstream and left audiences. It suggests that Fela's fame in the West is not in spite ...

To submit your answers to this test and earn 3 hours of CE credit, go www.aaoinfo.org log in as a member. Select the Education tab, then AJO-DO Tests. Purchase current test, or for any issue published preceding 12 months. The fee each is $20. You will take online but can download print PDF version test. Results are tabulated immediately. you must answer 75% questions correctly. If do not receiv...

A system-on-chip (SOC) usually consists of many memory cores with different sizes and functionality, and they typically represent a significant portion of the SOC and therefore dominate its yield. Diagnostics for yield enhancement of the memory cores thus is a very important issue. In this paper we present two data compression techniques that can be used to speed up the transmission of diagnost...