A chemical metaphor to model service selection for composition of services
暂无分享,去创建一个
[1] Andrea Klug. Workflow Handbook 1997 , 1997 .
[2] Jack J. Dongarra,et al. Experiments with Scheduling Using Simulated Annealing in a Grid Environment , 2002, GRID.
[3] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[4] Pascal Fradet,et al. Chemical Specification of Autonomic Systems , 2004, IASSE.
[5] Daniel Le Métayer,et al. Programming by multiset transformation , 1993, CACM.
[6] Ke Xu,et al. Multi-constrained routing based on simulated annealing , 2003, IEEE International Conference on Communications, 2003. ICC '03..
[7] V. Cerný. Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm , 1985 .
[8] Olivera Marjanovic,et al. Dynamic verification of temporal constraints in production workflows , 2000, Proceedings 11th Australasian Database Conference. ADC 2000 (Cat. No.PR00528).
[9] Johann Eder,et al. Time Constraints in Workflow Systems , 1999, CAiSE.
[10] Pascal Fradet,et al. Gamma and the Chemical Reaction Model: Fifteen Years After , 2000, WMP.
[11] Prithviraj Banerjee,et al. Parallel Simulated Annealing Algorithms for Cell Placement on Hypercube Multiprocessors , 1990, IEEE Trans. Parallel Distributed Syst..
[12] Pascal Fradet,et al. Generalised multisets for chemical programming , 2006, Math. Struct. Comput. Sci..
[13] Pascal Fradet,et al. Principles of Chemical Programming , 2004, RULE@RDP.