نتایج جستجو برای: critical path selection problem
تعداد نتایج: 1689527 فیلتر نتایج به سال:
in this paper a new guidance technique for ballistic missiles and launch vehicles is proposed. generally the lambert guidance is used to generate missile nominal (correlated) parameters through powered flight to put it in a ballistic flight path. because of uncertainties and undesired factors, the nominal position and velocity obtained by lambert technique need to be followed in actual flight. ...
Medical Virtual Patient Simulator (MedVPS) is a cutting-edge eLearning innovation for medical and other health professionals. It consists of a framework that supports various patient cases, tailored by interdisciplinary medical teams. Each virtual patient case follows the critical path to be followed for a specific patient in a hospital. MedVPS takes the student on a journey that enables the st...
Organizational critical activities (OCAs) are activities which must receive constant management attention in order for that organization to be successful in its industry. Some empirical studies have shown that all of these activities may not be well supported by organizations’ websites. This research attempts to develop the evaluation methodology which can be used to assess how well an organiza...
People traditionally have considered the number of counters in the critical path as the met ric for the performance of a multiplier This report presents the view that tree topologies which have the least number of levels do not always give the fastest possible multiplier when constrained to be part of a microprocessor It proposes two new topologies hybrid struc ture and higher order arrays whic...
Hierarchical Vision-motion Planning With Uncertainty: Local Path Planning And Global Route Selection
A new framework of a hierarchical vision-motion planning for a mobile robot under uncertainty is proposed. An optimal plan is generated by twolevel planning: global route selection and local path planning. In global route selection, a sequence of observation points to acquire sufficient information to reach a destination is determined. Both the cost and the uncertainty of vision are considered ...
In a biconnected graph, a detour is the best alternative path from a detour-starting vertex to the destination vertex. A detour-starting vertex is the vertex from which the original shortest path is changed. The longest detour (LD) problem is to find a detour-critical edge in a shortest path such that the removal of the edge results in the maximum distance increment. In this paper, we deal with...
The notion of the necessary criticality (both with respect to path and to activity) of a network with imprecisely defined (by means of intervals or fuzzy intervals) activity duration times is introduced and analyzed. It is shown, in the interval case, that both the problem of asserting whether a given path is necessarily critical and the problem of determining an arbitrary necessarily critical ...
In order to obtain an adequate description of risk aversion for insuring critical path problem, this paper develops a new class of two-stage minimum risk problems. The first-stage objective function is to minimize the probability of total costs exceeding a predetermined threshold value, while the secondstage objective function is to maximize the insured task durations. For general task duration...
This paper proposes a new method to solve fuzzy critical path problems for a project network with activity times being normalised trapezoidal fuzzy numbers. is solved successfully to demonstrate the validity of the proposed approach.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید