-
1
-
-
0033282409
-
A new algorithm for network probabilistic connectivity
-
Piscataway, NJ, IEEE Service Center
-
Yubin Chen, Jiandong Li, and Jiamo Chen. A new algorithm for network probabilistic connectivity. In Proceedings of the IEEE military communication conference, Piscataway, NJ, 1999. IEEE Service Center.
-
(1999)
Proceedings of the IEEE Military Communication Conference
-
-
Chen, Y.1
Li, J.2
Chen, J.3
-
4
-
-
20344370362
-
Analysis method of survivability of probabilistic networks
-
Li Ying. Analysis method of survivability of probabilistic networks. Military Communication Technology Magazine, 48, 1993.
-
(1993)
Military Communication Technology Magazine
, vol.48
-
-
Ying, L.1
-
5
-
-
0031223084
-
Local search genetic algorithm for optimal design of reliable networks
-
B. Dengiz, F. Altiparmak, and A. E. Smith. Local search genetic algorithm for optimal design of reliable networks. IEEE Trans. on Evolutionary Computation, 1(3):179-188, 1997.
-
(1997)
IEEE Trans. on Evolutionary Computation
, vol.1
, Issue.3
, pp. 179-188
-
-
Dengiz, B.1
Altiparmak, F.2
Smith, A.E.3
-
6
-
-
0032156812
-
Topological optimization of a reliable communication network
-
Sheng-Tzong Cheng. Topological optimization of a reliable communication network. IEEE Transactions on Reliability, 47(3):225-233, 1998.
-
(1998)
IEEE Transactions on Reliability
, vol.47
, Issue.3
, pp. 225-233
-
-
Cheng, S.-T.1
-
7
-
-
0034174055
-
Topological optimization model for communication network with multiple reliability goals
-
Baoding Liu and K. Iwamura. Topological optimization model for communication network with multiple reliability goals. Computer and Mathematics with Applications, 39:59-69, 2000.
-
(2000)
Computer and Mathematics with Applications
, vol.39
, pp. 59-69
-
-
Liu, B.1
Iwamura, K.2
-
8
-
-
0035882233
-
Spanning tree approach in all-terminal network reliability expansion
-
N. Fard and Tae-Han Lee. Spanning tree approach in all-terminal network reliability expansion, computer communications, 24:1348-1353, 2001.
-
(2001)
Computer Communications
, vol.24
, pp. 1348-1353
-
-
Fard, N.1
Lee, T.-H.2
-
9
-
-
0027555824
-
Topological optimization of a communication network subject to a reliability constraint
-
Rong-Hong Jan, Fung-Jen Hwang, and Sheng-Tzong Chen. Topological optimization of a communication network subject to a reliability constraint. IEEE Transactions on Reliability, 42(1):63-70, 93.
-
(1993)
IEEE Transactions on Reliability
, vol.42
, Issue.1
, pp. 63-70
-
-
Jan, R.-H.1
Hwang, F.-J.2
Chen, S.-T.3
-
12
-
-
0034174055
-
Topological optimization models for communication network with multiple reliability goals
-
B.Liu and K. Iwamura. Topological optimization models for communication network with multiple reliability goals. Computers and Mathematics with Applications, 39:59-69, 2000.
-
(2000)
Computers and Mathematics with Applications
, vol.39
, pp. 59-69
-
-
Liu, B.1
Iwamura, K.2
-
13
-
-
0019556403
-
Reliability evaluation in computer-communication networks
-
K.K. Aggarwal and Suresg Rai. Reliability evaluation in computer-communication networks. IEEE Transactions on Reliability, 30(1):32-35, 1981.
-
(1981)
IEEE Transactions on Reliability
, vol.30
, Issue.1
, pp. 32-35
-
-
Aggarwal, K.K.1
Rai, S.2
-
14
-
-
0035265870
-
Fishman's sampling plan for computing network reliability
-
E. Manzi E., M. Labbe, G. Latouche, and F. Maffioli. Fishman's sampling plan for computing network reliability. IEEE Transactions on Reliability, 50(1):41-46, 2001.
-
(2001)
IEEE Transactions on Reliability
, vol.50
, Issue.1
, pp. 41-46
-
-
Manzi E, E.1
Labbe, M.2
Latouche, G.3
Maffioli, F.4
-
16
-
-
85060258475
-
How to handle constraints with evolutionary algortihms
-
Lance Chambers, editor, Chapman & Hall/CRC
-
B.G.W. Craenen, A.E. Eiben, and E.Marchiori. How to handle constraints with evolutionary algortihms. In Lance Chambers, editor, Practical Handbook Of Genetic Algorithms: Applications, pages 341-361. Chapman & Hall/CRC, 2000.
-
(2000)
Practical Handbook of Genetic Algorithms: Applications
, pp. 341-361
-
-
Craenen, B.G.W.1
Eiben, A.E.2
Marchiori, E.3
-
17
-
-
0038192547
-
A genetic algorithm for survivable network design
-
S. Forrest, editor, San Mateo, CA, Morgan Kaufmann
-
L. Davis, D. Orvosh, A. Cox, and Y. Qiu. A genetic algorithm for survivable network design. In S. Forrest, editor, Proceedings of the Fifth International Conference on Genetic Algorithms, pages 408-415, San Mateo, CA, 1993. Morgan Kaufmann.
-
(1993)
Proceedings of the Fifth International Conference on Genetic Algorithms
, pp. 408-415
-
-
Davis, L.1
Orvosh, D.2
Cox, A.3
Qiu, Y.4
-
18
-
-
35248835248
-
Exploring a two-population genetic algorithm
-
Erick Cantu-Paz et al, editor, Berlin, Springer-Verlag
-
Steven Orla Kimbrough, Ming Lu, David Harlan Wood, and D.J. Wu. Exploring a two-population genetic algorithm. In Erick Cantu-Paz et al, editor, Proceedings of the Genetic and Evolutionary Computation Conference 2003, pages 1148-1159, Berlin, 2003. Springer-Verlag.
-
(2003)
Proceedings of the Genetic and Evolutionary Computation Conference 2003
, pp. 1148-1159
-
-
Kimbrough, S.O.1
Lu, M.2
Wood, D.H.3
Wu, D.J.4
-
19
-
-
0003722376
-
-
Addison-Wesley, Reading, MA
-
D. E. Goldberg. Genetic algorithms in search, optimization, and machine learning. Addison-Wesley, Reading, MA, 1989.
-
(1989)
Genetic Algorithms in Search, Optimization, and Machine Learning
-
-
Goldberg, D.E.1
-
20
-
-
24644494308
-
-
PhD thesis, Technische Universität Clausthal, Institut für Informatik, Clausthal, Germany
-
Jens Gottlieb. Evolutionary Algorithms for Constrained Optimization Problems. PhD thesis, Technische Universität Clausthal, Institut für Informatik, Clausthal, Germany, 1999.
-
(1999)
Evolutionary Algorithms for Constrained Optimization Problems
-
-
Gottlieb, J.1
-
21
-
-
33845623782
-
Neuer Beweis eines Satzes über Permutationen
-
H. Prüfer. Neuer Beweis eines Satzes über Permutationen. Archiv für Mathematik und Physik, 27:742-744, 1918.
-
(1918)
Archiv Für Mathematik Und Physik
, vol.27
, pp. 742-744
-
-
Prüfer, H.1
-
23
-
-
0008297013
-
An improved general upperbound for all-terminal network reliability
-
University of Pittsburgh
-
A. Konak and A. Smith. An improved general upperbound for all-terminal network reliability. Technical report, University of Pittsburgh, 1998.
-
(1998)
Technical Report
-
-
Konak, A.1
Smith, A.2
|