System and method for tree discovery
First Claim
1. A tree discovery method, the method carried out by program code stored on non-transient computer-readable medium and executed by a processor, the method comprising:
- identifying in computer-readable medium a first node for a system under consideration, each node in the computer-readable medium representing a characteristic of a component;
selecting at least a second node from the computer-readable medium for the first node, the at least second node selected from a non-exhaustive sampling of nodes as a child node of the first node contributing more to an impact on the system under consideration than any other child node of the first node; and
discovering in the computer-readable medium at least one system tree for the system under consideration based on the first node and the at least second node.
3 Assignments
0 Petitions
Accused Products
Abstract
Tree discovery systems and methods are disclosed. An example of a method is carried out by program code stored on non-transient computer-readable medium and executed by a processor. The method may include identifying in computer-readable medium a first node for a system under consideration, each node in the computer-readable medium representing a characteristic of a component. The method may include selecting at least a second node from the computer-readable medium for the first node. The method may include discovering in the computer-readable medium at least one system tree for the system under consideration based on the first node and the at least second node.
-
Citations
20 Claims
-
1. A tree discovery method, the method carried out by program code stored on non-transient computer-readable medium and executed by a processor, the method comprising:
-
identifying in computer-readable medium a first node for a system under consideration, each node in the computer-readable medium representing a characteristic of a component; selecting at least a second node from the computer-readable medium for the first node, the at least second node selected from a non-exhaustive sampling of nodes as a child node of the first node contributing more to an impact on the system under consideration than any other child node of the first node; and discovering in the computer-readable medium at least one system tree for the system under consideration based on the first node and the at least second node. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
-
9. A tree discovery system, comprising:
-
a non-transitory computer readable storage to store a plurality of nodes, each of the plurality of nodes representing a characteristic of a component; and an analysis engine stored on a non-transitory computer readable medium and executable by a processor, the analysis engine operatively associated with the computer readable storage to identify a first node for a system under consideration, and select at least a second node for the first node, the at least second node selected from a non-exhaustive sampling of nodes as a child node of the first node contributing more to an impact on the system under consideration than any other child node of the first node, wherein at least one system tree is generated for the system under consideration based on the first and second nodes. - View Dependent Claims (10, 11, 12, 13, 14, 15, 16, 17, 18)
-
-
19. A tree discovery system, comprising:
-
an analysis engine stored on a non-transitory computer readable storage and executable by a processor to identify a first node for a system under consideration, and select at least one second node for the first node, the at least one second node selected from a non-exhaustive sampling of nodes as a child node of the first node contributing more to an impact on the system under consideration than any other child node of the first node; and a tree generator to discover a system tree for the system under consideration based on the first node and the at least one second node. - View Dependent Claims (20)
-
Specification