A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Dynamic Asynchronous Aggregate Search for Solving QoS Compositions of Web Services
2006
2006 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology Workshops
There has been recently an increase of interests in Distributed Constraint Satisfaction (DisCSP) algorithms. Most of these algorithms assume that the set of variables and constraints in a DisCSP are completely known and fixed. However, these assumptions do not hold in many open environments where unexpected events and changes can happen. Therefore this issue needs to be addressed in order for a DisCSP algorithm to be practically used in real life applications. Our contribution in this paper is
doi:10.1109/wi-iatw.2006.60
dblp:conf/iat/NguyenKP06
fatcat:ksd2hi3fqzg2bfonk753sqpfpa