By the use of a simple predictor for dead time compensation, we show that an explicit pole-assignment algorithm can become or practical importance for processes with relatively large time delays. With the omission of the delay term in the closed-loop characteristic polynomial, solution of the pole-assignment control algorithm becomes computationally more efficient. The closed-loop system with an adaptive pole-assignment algorithm and a dead time compensation scheme is shown to be globally stable. The stability analysis is applicable to both minimum-phase and non-minimum-phase systems. For a particular class of processes, it is shown that the pole-assignment algorithm can take the form of a velocity-type, three-term, adaptive PID controller.