Critical Path Calculations

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

When is the Critical Path Not the Most Critical Path?

This paper challenges the conventional thinking, by proposing a new way to understand and use the term critical-path. At stake is much more than a semantic discussion of terminology. Numerous surveys have confirmed that CPM schedules are used for two primary reasons: project management and dispute resolution. To support either use, the critical-path must be identifiable in a consistent, objecti...

متن کامل

Approximate Shortest Path Calculations in Simple Polyhedra

This paper considers the calculation of a Euclidean shortest path (ESP) in a three-dimensional (3D) polyhedral space Π . We propose an approximate κ(ε) · O(M |V |) 3D ESP algorithm (excluding preprocessing), with preprocessing time complexity O(M |E| + |S| + |V | log |V |), for solving a special, but ‘fairly general’ case of the 3D ESP problem, where Π does not need to be convex, V and E are th...

متن کامل

modified reflection coefficient for use in mobile path loss calculations

in this paper the reflection coefficient of electromagnetic wave incidence on the walls of the buildings and obstacles that occurs in mobile communication path was modified by solving the riccati nonlinear equations. for this purpose, the building walls are assumed inhomogeneous layers where their permittivity changes as function of the wall thickness. using this reflection coefficient, a new p...

متن کامل

Workflow Timed Critical Path Optimization

Approaches to shorten workflow execution time have been discussed in many area of computer engineering such as parallel and distributed systems, a computer circuit, and PERT chart for project management. To optimize workflow model structure of workflow, an approach with corresponding algorithms is proposed to cut timed critical path of workflow schema, which has the longest average execution ti...

متن کامل

Computing Along the Critical Path

Modern processors come close to executing as fast as true dependencies allow. The particular dependencies that constrain execution speed constitute the critical path of execution. To optimize the performance of the processor, we either have to reduce the critical path or execute it more efficiently. In both cases, it can be done more effectively if we know the actual path. This paper describes ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Nature

سال: 1970

ISSN: 0028-0836,1476-4687

DOI: 10.1038/225668b0