Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,014,511 papers from all fields of science
Search
Sign In
Create Free Account
Critical path method
Known as:
CPM
, Critical Path
, Path analysis (business)
Expand
The critical path method (CPM) is an algorithm for scheduling a set of project activities.
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
29 relations
Algorithm
Amdahl's law
Bottleneck (engineering)
Critical graph
Expand
Broader (2)
Network theory
Operations research
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
Low-Latency Successive-Cancellation Polar Decoder Architectures Using 2-Bit Decoding
Bo Yuan
,
K. Parhi
IEEE Transactions on Circuits and Systems Part 1…
2014
Corpus ID: 16170708
Polar codes have emerged as important error correction codes due to their capacity-achieving property. Successive cancellation…
Expand
Highly Cited
2013
Highly Cited
2013
Memory-Efficient Hardware Architecture of 2-D Dual-Mode Lifting-Based Discrete Wavelet Transform
Chih-Hsien Hsia
,
Jen-Shiun Chiang
,
Jing-Ming Guo
IEEE transactions on circuits and systems for…
2013
Corpus ID: 26718700
Memory requirements (for storing intermediate signals) and critical path are essential issues for 2-D (or multidimensional…
Expand
2009
2009
Dynamic parallelization of single-threaded binary programs using speculative slicing
Cheng Wang
,
Youfeng Wu
,
+5 authors
J. Fang
International Conference on Supercomputing
2009
Corpus ID: 14507812
The performance of single-threaded programs and legacy binary code is of critical importance in many everyday applications…
Expand
Highly Cited
2008
Highly Cited
2008
Power and Area-Efficient Unified Computation of Vector and Elementary Functions for Handheld 3D Graphics Systems
Byeong-Gyu Nam
,
Hyejung Kim
,
H. Yoo
IEEE transactions on computers
2008
Corpus ID: 7190099
A unified computation method of vector and elementary functions is proposed for handheld 3D graphics systems. It unifies vector…
Expand
2008
2008
A Highly Efficient VLSI Architecture for H.264/AVC CAVLC Decoder
Heng-Yao Lin
,
Ying-Hong Lu
,
Bin-Da Liu
,
J. Yang
IEEE transactions on multimedia
2008
Corpus ID: 958915
In this paper, an efficient algorithm is proposed to improve the decoding efficiency of the context-based adaptive variable…
Expand
Highly Cited
2007
Highly Cited
2007
Variation-Aware Adaptive Voltage Scaling System
M. Elgebaly
,
M. Sachdev
IEEE Transactions on Very Large Scale Integration…
2007
Corpus ID: 12638702
Conventional voltage scaling systems require a delay margin to maintain a certain level of robustness across all possible device…
Expand
Highly Cited
2004
Highly Cited
2004
Using global code motions to improve the quality of results for high-level synthesis
S. Gupta
,
N. Savoiu
,
N. Dutt
,
Rajesh K. Gupta
,
A. Nicolau
IEEE Transactions on Computer-Aided Design of…
2004
Corpus ID: 8312479
The quality of synthesis results for most high-level synthesis approaches is strongly affected by the choice of control flow…
Expand
Highly Cited
2001
Highly Cited
2001
Reducing power with dynamic critical path information
J. Seng
,
Eric Tune
,
D. Tullsen
Proceedings. 34th ACM/IEEE International…
2001
Corpus ID: 1953549
Recent research has shown that dynamic information regarding instruction criticality can be used to increase microprocessor…
Expand
Highly Cited
1984
Highly Cited
1984
Delay and Power Optimization in VLSI Circuits
L. Glasser
,
L. Hoyte
Design Automation Conference, Proceedings
1984
Corpus ID: 5696916
The problem of optimally sizing the transistors in a digital MOS VLSI circuit is examined. Macro-models are developed and new…
Expand
Highly Cited
1981
Highly Cited
1981
Why Projects Are “Always” Late: A Rationale Based on Manual Simulation of a PERT/CPM Network
R. Schonberger
1981
Corpus ID: 62236454
The conventional procedure for determining the expected project completion time is to find the critical path; its duration is…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE