Traditionally, path selection within routing is formulated as a shortest path optimization problem. The objective function for optimization could be any one variety of parameters such as number of hops, delay, cost...etc. The problem of least cost delay constraint routing is studied in this paper since delay constraint is very common requirement of many multimedia applications and cost minimization captures the need to
distribute the network. So an iterative algorithm is proposed in this paper to solve this problem. It is appeared from the results of applying this algorithm that it gave the optimal path (optimal solution) from among multiple feasible paths (feasible solutions).

At present, the ability to promote national economy by adjusting to political, economic, and technological variables is one of the largest challenges faced by organization productivity. This challenge prompts changes in structure and line productivity, given that cash has not been invested. Thus, the management searches for investment opportunities that have achieved the optimum value of the annual increases in total output value of the production line workers in the laboratory. Therefore, the application of dynamic programming model is adopted in this study by addressing the division of investment expenditures to cope with market-dumping policy and to strive non-stop production at work.

In real world, almost all networks evolve over time. For example, in networks of friendships and acquaintances, people continually create and delete friendship relationship connections over time, thereby add and draw friends, and some people become part of new social networks or leave their networks, changing the nodes in the network. Recently, tracking communities encountering topological shifting drawn significant attentions and many successive algorithms have been proposed to model the problem. In general, evolutionary clustering can be defined as clustering data over time wherein two concepts: snapshot quality and temporal smoothness should be considered. Snapshot quality means that the clusters should be as precise as possible durin

Quality control charts are limited to controlling one characteristic of a production process, and it needs a large amount of data to determine control limits to control the process. Another limitation of the traditional control chart is that it doesn’t deal with the vague data environment. The fuzzy control charts work with the uncertainty that exists in the data. Also, the fuzzy control charts investigate the random variations found between the samples. In modern industries, productivity is often of different designs and a small volume that depends on the market need for demand (short-run production) implemented in the same type of machines to the production units. In such cases, it is difficult to determine the contr

Multilateral wells require a sophisticated type of well model to be applied in reservoir simulators to represent them. The model must be able to determine the flow rate of each fluid and the pressure throughout the well. The production rate calculations are very important because they give an indication about some main issues associated with multi-lateral wells such as one branch may produce water or gas before others, no production rate from one branch, and selecting the best location of a new branch for development process easily.                                &nbsp

Achieving energy-efficient Wireless Sensor Network (WSN) that monitors all targets at
all times is an essential challenge facing many large-scale surveillance applications.Singleobjective
set cover problem (SCP) is a well-known NP-hard optimization problem used to
set a minimum set of active sensors that efficiently cover all the targeted area. Realizing
that designing energy-efficient WSN and providing reliable coverage are in conflict with
each other, a multi-objective optimization tool is a strong choice for providing a set of
approximate Pareto optimal solutions (i.e., Pareto Front) that come up with tradeoff
between these two objectives. Thus, in the context of WSNs design problem, our main
contribution is to

The aim of this study was to Identifying The Effect of using Linear programming and Branching programming by computer in Learning and Retention of movement concatenation(Linkwork) in parallel bars in Artistic Gymnastics. The searchers have used the experimental method. The search subject of this article has been taken (30) male - students in the second class from the College of Physical Education/University of Baghdad divided into three groups; the first group applied linear programming by computer, and the second group has been applicated branching programming by computer, while precision group used traditional method in the college. The researchers concluded the results by using the statistical bag for social sciences (spss) such as both