Resource constraints are becoming a problem as many of the wireless mobile devices have
increased generality. Our work tries to address this growing demand on resources and performance,
by proposing the dynamic selection of neighbor nodes for cooperative service execution.
This selection is in
uenced by user's quality of service requirements expressed in his request,
tailoring provided service to user's speci c needs. In this paper we improve our proposal's
formulation algorithm with the ability to trade o time for the quality of the solution. At any
given time, a complete solution for service execution exists, and the quality of that solution is
expected to improve overtime
