Search Results

There are 1463380 results for: content related to: Sensor network design for maximizing reliability of linear processes

  1. Matrices of a Graph

    Graphs: Theory and Algorithms

    K. Thulasiraman, M. N. S. Swamy, Pages: 126–178, 2011

    Published Online : 22 FEB 2011, DOI: 10.1002/9781118033104.ch6

  2. Redundant sensor network design for linear processes

    AIChE Journal

    Volume 41, Issue 10, October 1995, Pages: 2237–2249, Yaqoob Ali and Shankar Narasimhan

    Article first published online : 17 JUN 2004, DOI: 10.1002/aic.690411007

  3. Design and upgrade of nonredundant and redundant linear sensor networks

    AIChE Journal

    Volume 45, Issue 9, September 1999, Pages: 1927–1938, Miguel J. Bagajewicz and Mabel C. Sánchez

    Article first published online : 16 APR 2004, DOI: 10.1002/aic.690450910

  4. Trees, Cutsets, and Circuits

    Graphs: Theory and Algorithms

    K. Thulasiraman, M. N. S. Swamy, Pages: 31–54, 2011

    Published Online : 22 FEB 2011, DOI: 10.1002/9781118033104.ch2

  5. The hyperbolicity problem in electrical circuit theory

    Mathematical Methods in the Applied Sciences

    Volume 33, Issue 17, 30 November 2010, Pages: 2037–2049, Ricardo Riaza and Caren Tischendorf

    Article first published online : 20 APR 2010, DOI: 10.1002/mma.1312

  6. Connectivity–splitting models for survivable network design

    Networks

    Volume 43, Issue 1, January 2004, Pages: 10–27, Anantaram Balakrishnan, Thomas L. Magnanti and Prakash Mirchandani

    Article first published online : 10 NOV 2003, DOI: 10.1002/net.10100

  7. A survey of some network reliability analysis and synthesis results

    Networks

    Volume 54, Issue 2, September 2009, Pages: 99–107, F.T. Boesch, A. Satyanarayana and C.L. Suffel

    Article first published online : 13 FEB 2009, DOI: 10.1002/net.20300

  8. Combining monte carlo estimates and bounds for network reliability

    Networks

    Volume 20, Issue 3, May 1990, Pages: 277–298, Louis D. Nel and Charles J. Colbourn

    Article first published online : 11 OCT 2006, DOI: 10.1002/net.3230200303

  9. Iterative algorithms for generating minimal cutsets in directed graphs

    Networks

    Volume 16, Issue 2, Summer 1986, Pages: 133–147, D. R. Shier and D. E. Whited

    Article first published online : 11 OCT 2006, DOI: 10.1002/net.3230160203

  10. Sensor network design for maximizing reliability of bilinear processes

    AIChE Journal

    Volume 42, Issue 9, September 1996, Pages: 2563–2575, Yaqoob Ali and Shankar Narasimhan

    Article first published online : 17 JUN 2004, DOI: 10.1002/aic.690420917

  11. Strong formulations for network design problems with connectivity requirements

    Networks

    Volume 45, Issue 2, March 2005, Pages: 61–79, Thomas L. Magnanti and S. Raghavan

    Article first published online : 10 JAN 2005, DOI: 10.1002/net.20046

  12. An optimal symbolic reliability expression using spanning trees for source-to-all-terminal systems

    Electronics and Communications in Japan (Part III: Fundamental Electronic Science)

    Volume 73, Issue 2, 1990, Pages: 46–56, Takashi Noda, Youichi Higashiyama, Hiromu Ariyoshi and Isao Shirakawa

    Article first published online : 21 FEB 2007, DOI: 10.1002/ecjc.4430730205

  13. Network transformations and bounding network reliability

    Networks

    Volume 23, Issue 1, January 1993, Pages: 1–17, Jason I. Brown, Charles J. Colbourn and John S. Devitt

    Article first published online : 11 OCT 2006, DOI: 10.1002/net.3230230103

  14. Arc tolerances in shortest path and network flow problems

    Networks

    Volume 10, Issue 4, Winter 1980, Pages: 277–291, D. R. Shier and Christoph Witzgall

    Article first published online : 11 OCT 2006, DOI: 10.1002/net.3230100402

  15. Exact calculation of computer network reliability

    Networks

    Volume 4, Issue 2, 1974, Pages: 95–112, E. Hänsler, G. K. McAuliffe and R. S. Wilkov

    Article first published online : 11 OCT 2006, DOI: 10.1002/net.3230040202

  16. Matroids

    Graphs: Theory and Algorithms

    K. Thulasiraman, M. N. S. Swamy, Pages: 265–305, 2011

    Published Online : 22 FEB 2011, DOI: 10.1002/9781118033104.ch10

  17. Shortest paths, single origin-destination network design, and associated polyhedra

    Networks

    Volume 23, Issue 2, March 1993, Pages: 103–121, Thomas L. Magnanti and Prakash Mirchandani

    Article first published online : 11 OCT 2006, DOI: 10.1002/net.3230230205

  18. Topological conditions for the solvability of linear active networks

    International Journal of Circuit Theory and Applications

    Volume 4, Issue 2, April 1976, Pages: 125–136, Takao Ozawa

    Article first published online : 12 DEC 2006, DOI: 10.1002/cta.4490040203

  19. Consecutive cuts and paths, and bounds on k-terminal reliability

    Networks

    Volume 25, Issue 3, May 1995, Pages: 165–175, Heidi J. Strayer and Charles J. Colbourn

    Article first published online : 11 OCT 2006, DOI: 10.1002/net.3230250309

  20. Graphs and Vector Spaces

    Graphs: Theory and Algorithms

    K. Thulasiraman, M. N. S. Swamy, Pages: 72–96, 2011

    Published Online : 22 FEB 2011, DOI: 10.1002/9781118033104.ch4