A BDD-Based Heuristic Algorithm for Design of Reliable Networks with Minimal Cost
暂无分享,去创建一个
[1] R. Boorstyn,et al. Large-Scale Network Topological Optimization , 1977, IEEE Trans. Commun..
[2] Randal E. Bryant,et al. Symbolic Boolean manipulation with ordered binary-decision diagrams , 1992, CSUR.
[3] R. Jan,et al. Topological optimization of a communication network subject to a reliability constraint , 1993 .
[4] Saburo Muroga,et al. Binary Decision Diagrams , 2000, The VLSI Handbook.
[5] David S. Johnson,et al. Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .
[6] Dimitrios M. Thilikos,et al. Computing Small Search Numbers in Linear Time , 2004, IWPEC.
[7] K. K. Aggarwal,et al. Topological layout of links for optimizing the s-t reliability in a computer communication system , 1982 .
[8] Alice E. Smith,et al. Local search genetic algorithm for optimal design of reliable networks , 1997, IEEE Trans. Evol. Comput..
[9] Sheng-Tzong Cheng. Topological optimization of a reliable communication network , 1998 .
[10] Randal E. Bryant,et al. Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.
[11] Z W Birnbaum,et al. ON THE IMPORTANCE OF DIFFERENT COMPONENTS IN A MULTICOMPONENT SYSTEM , 1968 .
[12] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[13] N. Limnios,et al. Computing all-terminal reliability of stochastic networks with Binary Decision Diagrams , 2005 .