We propose a framework for solving Distributed Valued Constraint Satisfaction Problems (DisVCSP). This approach permits us to define a new framework for the enumeration, which we expect that it will benefit from the advantages of two approaches : recording and exploiting the valued nogoods in Valued Dynamic Backtracking (Dago, 1997); the completness of search and the asynchronisme between agents in Distibuted Dynamic Backtracking (Belaissaoui, 2001).