| 摘要 |
<p>Methods and an apparatus for rapidly converging on a solution in a large ragged search space, such as NP-Complete space, where the solution is good but not necessarily the most optimum are provided. In one embodiment, a method for solving NP-Complete or similar problems appearing in every day situations in a short time within a specified degree of certainty is provided. The method initiates with a set of randomly generated trial solutions. The randomly generated solutions are statistically analyzed and a set of guidelines is produced. The initial trial solutions and their results are discarded, and a new set is instantiated using the newly produced guidelines. This process repeats iteratively until an acceptable solution is reached. A computer readable medium and an apparatus configured to execute the computer readable medium are provided.</p> |
