  A new algorithm designed to reduce the model dependence in future SUSY
searches at the LHC is described. This algorithm can dynamically adapt itself
to a wide range of possible SUSY final states thus reducing the need for
detailed model-driven analysis. Preliminary study of its performance on
simulated MSSM, GMSB and AMSB final states is described, and a comparison with
traditional search procedures, whenever available, is performed.
