Skip to search formSkip to main contentSkip to account menu

Critical path method

Known as: CPM, Critical Path, Path analysis (business) 
The critical path method (CPM) is an algorithm for scheduling a set of project activities.
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
This paper presents the design methods of residue-to-binary (reverse) converters for two 4-moduli sets {2<sup>k</sup>, 2<sup>n… 
Highly Cited
2014
Highly Cited
2014
Polar codes have emerged as important error correction codes due to their capacity-achieving property. Successive cancellation… 
Highly Cited
2012
Highly Cited
2012
In this paper we present an FPGA implementation of a high-speed elliptic curve scalar multiplier for binary finite fields. High… 
2009
2009
The performance of single-threaded programs and legacy binary code is of critical importance in many everyday applications… 
2008
2008
In this paper, an efficient algorithm is proposed to improve the decoding efficiency of the context-based adaptive variable… 
Highly Cited
2007
Highly Cited
2007
Conventional voltage scaling systems require a delay margin to maintain a certain level of robustness across all possible device… 
Highly Cited
2001
Highly Cited
2001
Recent research has shown that dynamic information regarding instruction criticality can be used to increase microprocessor… 
1999
1999
A variable supply-voltage (VS) scheme with a high power-conversion-efficiency DC-DC converter is presented. A new pulse width… 
Highly Cited
1984
Highly Cited
1984
The problem of optimally sizing the transistors in a digital MOS VLSI circuit is examined. Macro-models are developed and new… 
Highly Cited
1981
Highly Cited
1981
The conventional procedure for determining the expected project completion time is to find the critical path; its duration is…