The talk focuses on computational aspect of a new version of Adaptive Finite Element Methods which allows elements of different degrees. We shall discuss p-refinement, p-unrefinement algorithms, basis functions for transition elements and problems arise in using this method with a domain decomposition solver on a parallel computer. Some demos of the method will be presented.