Time: 1.5 hours Constraint satisfaction problem (CSP) (約束滿足問題) Definition: "mathematical problems defined as a set of objects whose state must satisfy a number of constraints or limitations" (Wikipedia) 屬於AI和Operation Research研究的領域.
WSAD/RAD用習慣了,對VS裡的快速鍵很不習慣,先修改幾個最常用的:Tools->Options->Keyboard在VS2008裡是 Tools->Options->Environment->KeyboardEdit.FindNextSelected: remove old & assign it with "F3"Edit.FindPreviousSelected: assign it with
Time Spended: 4.5 hours第一作者的publication list如下(dblp): Mohammad Alrifai(L3S Research Center, University of Hannover) and Thomas Risse. Combining Global Optimization with Local Selection for Efficient QoS-aware Service Composition, WWW, 2009Mohammad
Time: 2 hours N. Sato, Kishor S. Trivedi: Accurate and efficient stochastic reliability analysis of composite services using their compact Markov reward model representations. IEEE SCC 2007: 114-121 作者裡的Trivedi是大牛, 杜克大學的資深教授, 在Reliability
文章目錄 簡單資訊1. 文章結構2.Claims3. Service Composition Requirements4. Web Service Composition Approaches5. Method Comparison 簡單資訊Title Current solutions for Web service composition Journal IEEE Internet Computing Year 2004
Time: 5.0 hours Gu, Q. and P. Lago, Exploring service-oriented system engineering challenges: a systematic literature review. Service Oriented Computing and Applications, 2009. 3(3): p. 171-188. 作者Qing Gu是阿姆斯特丹自由大學(VU Universiteit)的教員,