AMF configurations: Checking for service protection using heuristics
暂无分享,去创建一个
[1] Abdelwahab Hamou-Lhadj,et al. Checking Service Instance Protection for AMF Configurations , 2009, 2009 Third IEEE International Conference on Secure Software Integration and Reliability Improvement.
[2] C. Kenyon. Best-fit bin-packing with random order , 1996, SODA '96.
[3] P. Cochat,et al. Et al , 2008, Archives de pediatrie : organe officiel de la Societe francaise de pediatrie.
[4] Chetan S. Rao,et al. Improved approximation bounds for Vector Bin Packing , 2010, ArXiv.
[5] Abdelwahab Hamou-Lhadj,et al. A model driven approach for AMF configuration generation , 2010, SAM'10.
[6] Edward G. Coffman,et al. Approximation algorithms for bin packing: a survey , 1996 .
[7] Christopher Oggerino. High Availability Network Fundamentals: A Practical Guide to Predicting Network Availability , 2001 .
[8] J. B. G. Frenk,et al. On the multidimensional vector bin packing , 1990, Acta Cybern..
[9] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[10] Judea Pearl,et al. Heuristics : intelligent search strategies for computer problem solving , 1984 .
[11] Susanne Albers,et al. Average-case analyses of first fit and random fit bin packing , 2000, SODA '98.
[12] György Dósa,et al. The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) <= 11/9OPT(I) + 6/9 , 2007, ESCAPE.
[13] Boaz Patt-Shamir,et al. Vector bin packing with multiple-choice , 2009, Discret. Appl. Math..