| 摘要 |
PROBLEM TO BE SOLVED: To shorten a processing time by shortening, for example, a communication time while reducing the possibility of insufficient memory, when dividing a binary decision graph (BDD) and allocating partial problems to a plurality of computers.SOLUTION: A binary decision graph processing system includes a master device and a local device. The master device divides a whole problem into a plurality of partial problems and transmits at least two partial problems among the plurality of partial problems to the local device. The local device receives the at least two partial problems from the master device, creates a binary decision graph representing a solution meeting respective restriction conditions of the at least two partial problems, and creates one binary decision graph by performing an operation between binary decision graphs representing respective solutions to the partial problems so as to shorten a processing time by shortening, for example, a communication time while reducing the possibility of insufficient memory. |
