Abstract:
A variable embedding method, for solving a large-scale problem using dedicated hardware by dividing variables of a problem graph into partial problems and by repeating an optimization process of the partial problems when an interaction of the variables of an optimization problem is expressed in the problem graph, includes: determining whether a duplicate allocation of the variables of the optimization problem to the vertices of the hardware graph is required when embedding at least a part of all the variables into the vertices of the hardware graph; and selecting one of the variables requiring no duplicate allocation and embedding selected variable in one of the vertices of the hardware graph without using another one of the variables requiring the duplicate allocation as one of the variables of the partial problem.
Abstract:
A 4B5B encoder converts an inputted 4-bit data into a pattern of a 5-bit data in which (i) the number of bits of consecutive “0” data values is permitted to be maximum two, and, simultaneously, (ii) maximum one bit of head end two bits is permitted to have a “0” data value and maximum one bit of tail end two bits is permitted to have a “0” data value. A 5N-bit command encoder converts a command into a command pattern in which the number of bits contained in consecutive “0” data values is permitted to be maximum two. The data after the conversion and the command after the conversion are converted into NRZI codes by an NRZI encoder.
Abstract:
In an ising solver system, change of a capacitated variable in an ising solver is able to be described by introducing an interaction between QUBO variables depending on a relation between a departure point of a first city among multiple cities and an arrival point of a second city among the multiple cities, and a concept of an inter-city travel step number for travel between the multiple cities is expressed by describing the change.
Abstract:
A non-transitory computer-readable storage medium storing a nonlinear optimization program of a continuous value optimization problem, the program relating to an optimization problem, is provided. The program causes an optimization apparatus to execute repeatedly and alternately procedure comprising: updating a variable of an evaluation function, causing an equality constraint to be gradually approached while searching for a condition at which the evaluation function approaches an extreme value; and updating the variable of the equality constraint, causing a condition at which the evaluation function to become close to the extreme value while keeping the equality constraint satisfied is gradually approached.