NDLI: Experimental results on preprocessing of path/cut terms in sum of disjoint products technique

Content Provider	IEEE Xplore Digital Library
Author	Soh, S. Rai, S.
Copyright Year	1991
Description	Author affiliation: Dept. of Electr. & Comput. Eng., Louisiana State Univ., Baton Rouge, LA, USA (Soh, S.; Rai, S.)
Abstract	Experimental results are presented showing the number of disjoint products and computer time involved in generating sum of disjoint product (SDP) terms. To help obtain the results, the authors have considered 19 benchmark networks containing paths (cuts) varying from 4 (4) to 780 (7376). Several SDP techniques are reviewed and are generalized into three propositions to find their inherent merits and demerits. An efficient SDP technique is, then, utilized to run input files of paths/cuts preprocessed using (1) cardinality, (2) lexicographic, and (3) Hamming distance ordering methods and their combinations. The experimental evaluation has been performed on an FPS 500 system. Results are analyzed, and it is shown that the preprocessing based on cardinality or its combinations with (2) and/or (3) performs better.
Starting Page	533
Ending Page	542
File Size	599184
Page Count	10
File Format	PDF
ISBN	0879426942
DOI	10.1109/INFCOM.1991.147550
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1991-04-07
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Polynomials Boolean functions Computer networks Performance analysis Iterative algorithms Intelligent networks Reliability engineering Computer network reliability Hamming distance Data preprocessing
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Experimental results on preprocessing of path/cut terms in sim of disjoint products technique

A simple algorithm for sum of disjoint products

A self generating disjoint minimal cut-set method for evaluating the reliability of interconnection networks

A Minimizing Algorithm for Sum of Disjoint Products

An Improved Sum-of-Disjoint-Products Technique for Symbolic Multi-State Flow Network Reliability

EXOR Projected Sum of Products

Recursive Disjoint Products: A Review of Three Algorithms

Connections between nonlinearity and restrictions, terms and hypergraphs of Boolean functions

Benchmarking dynamic Bayesian network structure learning algorithms

Experimental results on preprocessing of path/cut terms in sum of disjoint products technique

Similar Documents

Experimental results on preprocessing of path/cut terms in sim of disjoint products technique

A simple algorithm for sum of disjoint products

A self generating disjoint minimal cut-set method for evaluating the reliability of interconnection networks

A Minimizing Algorithm for Sum of Disjoint Products

An Improved Sum-of-Disjoint-Products Technique for Symbolic Multi-State Flow Network Reliability

EXOR Projected Sum of Products

Recursive Disjoint Products: A Review of Three Algorithms

Connections between nonlinearity and restrictions, terms and hypergraphs of Boolean functions

Benchmarking dynamic Bayesian network structure learning algorithms

Experimental results on preprocessing of path/cut terms in sum of disjoint products technique