Daniel W Shevitz

US Patent:

20110066621, Mar 17, 2011

Filed:

Sep 17, 2009

Appl. No.:

12/561729

Inventors:

Daniel Wolf SHEVITZ - Los Alamos NM, US

Assignee:

Los Alamos National Security, LLC - Los Alamos NM

International Classification:

G06F 17/30

US Classification:

707741, 707E17087

Abstract:

An embodiment of the present invention includes a method for analyzing and solving possibility tree. A possibility tree having a plurality of programmable nodes is constructed and solved with a solver module executed by a processor element. The solver module executes the programming of said nodes, and tracks the state of at least a variable through a branch. When a variable of said branch is out of tolerance with a parameter, the solver disables remaining nodes of the branch and marks the branch as an invalid solution. The valid solutions are then aggregated and displayed as valid tree solutions.