Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 231,026,534 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.
2014
2014
Design of Reverse Converters for General RNS Moduli Sets $\{ 2^{k}, 2^{n}-1, 2^{n}+1, 2^{n+1}-1 \}$ and $\{ 2^{k}, 2^{n}-1, 2^{n}+1, 2^{n-1}-1 \}$ ($n$ even)
Piotr Patronik
,
S. Piestrak
IEEE Transactions on Circuits and Systems Part 1…
2014
Corpus ID: 7402152
This paper presents the design methods of residue-to-binary (reverse) converters for two 4-moduli sets {2<sup>k</sup>, 2<sup>n…
Expand
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
2012
Highly Cited
2012
Pushing the Limits of High-Speed GF(2 m ) Elliptic Curve Scalar Multiplication on FPGAs
C. Rebeiro
,
S. Roy
,
Debdeep Mukhopadhyay
Workshop on Cryptographic Hardware and Embedded…
2012
Corpus ID: 14332624
In this paper we present an FPGA implementation of a high-speed elliptic curve scalar multiplier for binary finite fields. High…
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
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
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
1999
1999
Variable supply-voltage scheme with 95%-efficiency DC-DC converter for MPEG-4 codec
Fuyuki Ichiba
,
Kojiro Suzuki
,
Shinji Mita
,
T. Kuroda
,
T. Furuyama
Proceedings / International Symposium on Low…
1999
Corpus ID: 17647492
A variable supply-voltage (VS) scheme with a high power-conversion-efficiency DC-DC converter is presented. A new pulse width…
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