A system for conditioning algorithms to achieve optimum execution time is disclosed. The system defines a computer programmable framework that can be used to efficiently find a global optimization vector. The system provides a precise execution sequencing of operations in order to achieve a speedy conclusion and a genetic receipt for finding the optimal number of siblings (cluster nodes) for the algorithm. The system defines the genetic function for generating an initial population of solution vectors, a condition number for optimal searching of a single vector, a best fit off-springs selection method, and a diversification function.

 
Web www.patentalert.com

< Summary evaluation apparatus and method, and computer-readable recording medium in which summary evaluation program is recorded

> Semi-automatic generation of behavior models continuous value using iterative probing of a device or existing component model

~ 00408