18351570. DATA PROCESSING APPARATUS, STORAGE MEDIUM, AND DATA PROCESSING METHOD simplified abstract (Fujitsu Limited)
Contents
- 1 DATA PROCESSING APPARATUS, STORAGE MEDIUM, AND DATA PROCESSING METHOD
- 1.1 Organization Name
- 1.2 Inventor(s)
- 1.3 DATA PROCESSING APPARATUS, STORAGE MEDIUM, AND DATA PROCESSING METHOD - A simplified explanation of the abstract
- 1.4 Simplified Explanation
- 1.5 Potential Applications
- 1.6 Problems Solved
- 1.7 Benefits
- 1.8 Potential Commercial Applications
- 1.9 Possible Prior Art
- 1.10 Original Abstract Submitted
DATA PROCESSING APPARATUS, STORAGE MEDIUM, AND DATA PROCESSING METHOD
Organization Name
Inventor(s)
Yasuhiro Watanabe of Kawasaki (JP)
DATA PROCESSING APPARATUS, STORAGE MEDIUM, AND DATA PROCESSING METHOD - A simplified explanation of the abstract
This abstract first appeared for US patent application 18351570 titled 'DATA PROCESSING APPARATUS, STORAGE MEDIUM, AND DATA PROCESSING METHOD
Simplified Explanation
The abstract describes a data processing apparatus that handles a combinatorial optimization problem by updating local fields of state variables based on changes in the evaluation function.
- The apparatus acquires change amounts of the evaluation function for each state variable.
- It updates the local field of a state variable every time that variable is changed.
- It calculates the cumulative change amount and decides whether to accept changes in a subset of state variables.
- If changes are not accepted, the updated local field value is returned to a previous value.
Potential Applications
This technology could be applied in various fields such as logistics, scheduling, resource allocation, and network optimization where combinatorial optimization problems are common.
Problems Solved
1. Efficiently handling combinatorial optimization problems by updating local fields based on changes in state variables. 2. Managing changes in a subset of state variables to optimize the overall evaluation function.
Benefits
1. Improved optimization of complex problems. 2. Real-time updates to local fields for better decision-making. 3. Enhanced performance in solving combinatorial optimization problems.
Potential Commercial Applications
Optimization software for industries like transportation, manufacturing, telecommunications, and finance could benefit from this technology.
Possible Prior Art
One possible prior art could be the use of simulated annealing algorithms in combinatorial optimization to update state variables and evaluate functions iteratively.
Unanswered Questions
How does this technology compare to existing optimization algorithms in terms of efficiency and accuracy?
This article provides a detailed explanation of the data processing apparatus for combinatorial optimization problems. However, it does not directly compare the efficiency and accuracy of this technology with existing optimization algorithms.
What are the potential limitations or constraints of implementing this technology in real-world applications?
While the abstract outlines the functionality of the data processing apparatus, it does not address the potential challenges or limitations that may arise when implementing this technology in practical scenarios.
Original Abstract Submitted
A data processing apparatus configured to: acquire a change amount of a value of an evaluation function of a combinatorial optimization problem for each of a plurality of state variables included in the evaluation function, update, every time one of the plurality of state variables is changed, a value of a local field of the one of the plurality of state variables, acquire a cumulative value of the change amount, determine whether to accept a change in values of a first number, which is equal to or more than 2, of the plurality of state variables, based on the cumulative value, and when the change in values of the first number is not accepted, return the updated value of the local field to a value of a local field at the certain time point.
