نتایج جستجو برای: project critical path problem

تعداد نتایج: 1630087  

Journal: :Discrete Applied Mathematics 2015

2007
Bilal Gonen

With the growth of the Internet, Internet Service Providers (ISPs) try to meet the increasing traffic demand with new technology and improved utilization of existing resources. Routing of data packets can affect network utilization. Packets are sent along network paths from source to destination following a protocol. Open Shortest Path First (OSPF) is the most commonly used intra-domain Interne...

2001
Philippe Waroquiers Stef van Vlierberghe Dirk Craeynest Andrew Hately Erik Duvinage

The CFMU has developed mission critical applications for Europewide flight plan processing and air traffic management activities using Ada83. This paper presents the techniques and tools used for the migration from an Ada83 to an Ada95 compiler and run-time. It puts a particular emphasis on both the software management aspects and the technical aspects e.g. language aspects, run-time evolution,...

2003
Gang Cheng Ye Tian Nirwan Ansari

Finding a feasible path subject to multiple constraints in a network is an NP-complete problem and cannot be solved in polynomial time. Thus, many proposed source routing algorithms tackle this problem by transforming it into the shortest path problem, which is P-complete, with an integrated cost function that maps multi-constraints into a single cost. However, this approach may fail to find a ...

Journal: :international journal of advanced design and manufacturing technology 0
habib esfandiar moharam habibnejad korayem mohammad haghpanahi

in present paper, a point to point optimal path is planned for a mobile manipulator with flexible links and joints. for this purpose, a perfect dynamic modeling is performed for mobile manipulators considering large deformation in links, shear effects, elastic joints, effect of gravitation, and non-holonomic constraints. to study large deformation of links, non-linear relation of displacement-s...

2011
Venkata M. V. Gunturi Ernesto Nunes KwangSoo Yang Shashi Shekhar

Given a spatio-temporal network, a source, a destination, and a start-time interval, the All-start-time Lagrangian Shortest Paths (ALSP) problem determines a path set which includes the shortest path for every start time in the given interval. ALSP is important for critical societal applications related to air travel, road travel, and other spatiotemporal networks. However, ALSP is computationa...

The most important aim of every project is on time completion, budget consideration and reaching the highest possible quality, based on contract. This paper suggests a methodology for risk management in engineering, procurement, and construction (EPC) projects. Risk management enables project teams to perform with minimum deviation from predetermined goals. The proposed methodology identifies a...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید