  We investigate various aspects of the "weighted" greedy algorithm with
respect to a Schauder basis. For a weight w, we describe w-greedy,
w-almost-greedy and w-partially-greedy bases, and show some properties of
w-semi-greedy bases. To achieve these goals, we introduce and study the
w-Property (A).
