| Patent application number | Description | Published |
|---|
| 20100292928 | SYSTEMS AND METHODS FOR GENERATING RANDOM FEASIBLE SOLUTIONS FOR AN EVOLUTIONARY PROCESS - Systems and methods may include identifying an input population of parent chromosome data structures, where each parent chromosome data structure provides a plurality of genes representative of variables in which associated values are permitted to evolve; selecting pairs of parent chromosome data structures from the input population of parent chromosome data structures; combining genes of each selected pair of parent chromosome data structures according to at least one evolutionary operator to generate a plurality of child chromosome data structures; evaluating the plurality of child chromosome data structures according to a plurality of constraint functions to generate a respective plurality of constraint function values for each child chromosome data structure, where the constraint functions define constraints on a feasible solution set; determining whether any of the plurality of child chromosome data structures are within the feasible solution set based upon the respective plurality of constraint violation function values. | 11-18-2010 |
| 20100292929 | SYSTEMS AND METHODS FOR GENERATING FEASIBLE SOLUTIONS FROM TWO PARENTS FOR AN EVOLUTIONARY PROCESS - Systems and methods may include receiving a pair of parent chromosome data structures, where each parent chromosome data structure provides a plurality of genes representative of variables that are permitted to evolve; combining genes of the two parent chromosome data structures to generate at least one first child chromosome data structure; evaluating the at least one first child chromosome data structures according to a plurality of constraint functions to generate a respective plurality of constraint function values for each of the at least one first child chromosome data structure, where the constraint functions define constraints on a feasible solution set; determining whether any of the at least one first child chromosome data structure is within the feasible solution set. | 11-18-2010 |
| 20100293119 | SYSTEMS AND METHODS FOR PARALLEL PROCESSING OPTIMIZATION FOR AN EVOLUTIONARY ALGORITHM - The systems and methods may include receiving an initial population of parent chromosome data structures, where each parent chromosome data structure provides a plurality of genes; selecting pairs of parent chromosome data structures; applying at least one evolutionary operator to the genes of the selected pairs to generate a plurality of child chromosome data structures; allocating, the generated plurality of child chromosome structures to a plurality slave processors, where each slave processor evaluates one or more of the plurality of child chromosome data structures and generates respective objective function values; receiving objective function values for a portion of the plurality of allocated child chromosome data structures; merging the parent chromosome data structures with the received portion of the child chromosome data structures for which objective function values have been received; and identifying a portion of the merged set of chromosome data structures as an elite set of chromosome data structures. | 11-18-2010 |
| 20100293120 | SYSTEMS AND METHODS FOR BOX FITNESS TERMINATION OF A JOB OF AN EVOLUTIONARY SOFTWARE PROGRAM - Systems and methods may include receiving a respective plurality of objective function values for each chromosome data structure of a population, where the respective plurality of objective function values are obtained based upon an evaluation of each chromosome data structure; mapping the respective objective function values to respective epsilon values, where the respective epsilon values define a respective address associated with the plurality of objective functions; and performing non-domination sorting of the population to generate a reduced population of chromosome data structures; and performing epsilon non-dominated sorting to identify an elite set of addresses, where the prior steps are performed for a current generation, where the elite set of addresses are compared to a prior elite set of addresses for a predetermined number of prior generations to determine one or more variance values, where the one or more variance values are utilized to determine whether a current job of an evolutionary algorithm is to be halted. | 11-18-2010 |
| 20100293121 | SYSTEMS AND METHODS FOR PARALLEL PROCESSING WITH INFEASIBILITY CHECKING MECHANISM - Systems and methods may include obtaining an input population of parent chromosome data structures, where each parent chromosome data structure provides having a plurality of genes representative of variables in which associated values are permitted to evolve; selecting pairs of parent chromosome data structures from the input population; allocating the selected pairs of parent chromosome data structures to respective ones of a plurality of slave processors, where each slave processor applies an evolutionary process to genes of the allocated pair to generate a plurality of child chromosome data structures; receiving a portion of the plurality of child chromosome data structures generated by the plurality of slave processors; merging the parent chromosome data structures with at least the received portion of the child chromosome data structures to generate a merged set of chromosome data structures; and identifying a portion of the merged set of chromosome data structures as an elite set of chromosome data structures. | 11-18-2010 |
| 20100293122 | SYSTEMS AND METHODS FOR AN APPLICATION PROGRAM INTERFACE TO AN EVOLUTIONARY SOFTWARE PROGRAM - Systems and methods may include an application program interface that enables a user to: specify parameters associated with an evolutionary algorithm, where an execution of the evolutionary algorithm is in accordance with the specified parameters; define a chromosome data structure that includes a plurality of variables that are permitted to evolve in value in accordance with the execution of the evolutionary algorithm in order to generate one or more child chromosome data structures; identify one or more objective functions for evaluating chromosome data structures, including the generated one or more child chromosome data structures; and define an output format for providing one or more optimal chromosome data structures of the evaluated generated child chromosome data structures as designs to the identified objective functions. | 11-18-2010 |
| 20100293313 | SYSTEMS AND METHODS FOR A CORE MANAGEMENT SYSTEM FOR PARALLEL PROCESSING OF AN EVOLUTIONARY ALGORITHM - Systems and methods are provided for a core management system for parallel processing of an evolutionary algorithm. The systems and methods may include identifying, for a processing environment, a plurality of arriving processors available for utilization; configuring a first number of the plurality of arriving processors as master processors for the processing environment; configuring a respective second number of the plurality of arriving processors as slave processors, where each master processor is assigned one or more of the slave processors for the processing environment, where each master processor maintains timing data associated with available processing resources at the respective master processor, where each master processor is operative to calculate a respective target number of slaves based upon the respective timing data; and reconfiguring a current number of slave processors assigned to one or more respective master processors based upon the respective timing data calculated for the one or more respective master processors. | 11-18-2010 |
