R. Sosic and J. Gu, “Efficient Local Search with Conflict Minimization: A Case Study of the n-Queens Problem,” IEEE Transactions on Knowledge and Data Engineering, 1994, Vol. 6, No. 5, pp. 661-668.

has been cited by the following article:

• TITLE: A Min-Conflict Heuristic-Based Web Service Chain Reconfiguration Approach

  AUTHORS: Haifeng Li, Xiaoxia Yang

  KEYWORDS: Web services composition, Min-Conflict Heuristic, Reconfiguration

  JOURNAL NAME: Intelligent Information Management, Vol.2 No.10, October 29, 2010

  ABSTRACT: The state-of-art Web services composition approaches are facing more and more serious bottlenecks of effectiveness and stability with the increasing diversity and real-time requirements of applications, since new web service chain must be generated from “scratch” for each application. To break these bottlenecks, this paper presents a Min-Conflict Heuristic-Based Web Service Chain Reconfiguration Approach(MCHRC) to maximal reuse relative web services chain: a min-conflict heuristic based regression search algorithms is proposed to implement the web services chain reconfiguration based on the formal definition of process constraint and integrity constraint to guarantee the correctness and integrality of the reconfiguration. This benefits the service reuse and then can relieve the time complexity of web service composition and improve web services chain executing stability by reduce service provider load. Experimental results show that this approach makes significant improvement on the effectiveness of web services composition.