A system and process for generalizing an evolutionary process applied to a particular domain involving different problems includes a researcher module for generating a configuration specification applicable to a particular problem. An evolution module parses the configuration specification into a representative tree structure, assembles policies for each node in the tree structure, and generates candidate genomes using the policies for each node in the tree structure. The policies may be applied to new data or data from prior runs to generate candidate genomes. The evolution module translates internal representations of the generated candidate genomes into known representations of the candidate genome for evaluation in accordance with the particular domain parameters by a candidate evaluation module.

A first set of subconditions is obtained. Approximate matching of the first set of subconditions against a plurality of sets of subconditions is performed. A second set of subconditions among the plurality of sets of subconditions is accessed, wherein a representation of a subcondition in the first set and/or the second set of subconditions comprises a value having one of a plurality of states, and wherein the plurality of states comprises a state of “don't care”. The first set of subconditions is approximately matched against the second set of subconditions. The first set of subconditions is compared against the second set of subconditions. A matching criterion is determined to be met based on a result of the matching. Information indicating that the second set of subconditions is at least an approximate match for the first set of subconditions is output.

Computer processing and outcome prediction systems and methods used to generate algorithm time prediction polynomials, inverse algorithm time prediction polynomials, determine race conditions, determine when a non-linear algorithm can be treated as if it were linear, as well as automatically generate parallel and quantum solutions from classical software or from the relationship between monotonic attribute values.

A system for performing cascading search includes an associative memory array, a controller, a similarity search processor and an exact match processor. The associative memory array stores a plurality of multiportion data vectors stored in at least one column of the associative memory array. Each vector has a first portion and a second portion which are aligned to each other in the column. The controller controls the associative memory array to perform a similarity search of a similarity query on the first portion and an exact search of an exact query on the second portion. The similarity match processor generates a match row including match bit indications aligned with each similarity matched column. The match row indicates which columns have first portions which match to the similarity query. The exact match processor outputs exact match columns from among the similarity matched columns which have second portions which match the exact query.

Provided is a system and method for searching for a target key in a database, the method including populating a hash-offset table of a sorted key table with hash-offset table entries, the hash-offset table entries having a hash-value corresponding to a respective key, and a hash offset, sorting the hash-offset table entries based on the hash-values, searching for a target hash-value of the hash-values corresponding to a target key in the hash-offset table, locating a target key-value pair corresponding to the target key based on the target hash-value, and saving a location of the target key-value pair.

Techniques for splitting a query into native query operations and post-processing operations are provided. In one embodiment, a user query including a plurality of search parameters is received. Expressions representing the plurality of search parameters in the user query are determined. A first subset and a second subset of the expressions are identified. Each expression of the first subset corresponds to one of a plurality of native query operations executable by a database platform, and each expression of the second subset corresponds to one of a plurality of predefined post-processing operations not executable by the database platform. A database query is generated based on one or more expressions of the first subset, and a post-processing query is generated based on each expression in the second subset. The database query is executed by the database platform, then the post-processing query is executed on the results from database platform.

In one embodiment, a service divides one or more time series for a network key performance (KPI) into a plurality of time series chunks. The service clusters the plurality of time series chunks into a plurality of clusters. The service identifies a sketch that represents a particular one of the clusters. The service associates a label with the identified sketch. The service applies the label to a new KPI time series by matching the sketch to the new KPI time series.

A method of determining an indication of an intersection between a first dataset and a second dataset, the first and second datasets each holding entries in association with at least one key, the method comprising: generating for the at least one key in the first dataset location information in a first binary structure by applying a deterministic function to the entries associated with the key; transmitting the first binary structure to a comparison stage; generating for the at least one key in the second dataset, location information in a second binary structure by applying the same deterministic function to the entries associated with the key; and comparing, at the comparison stage, the location information in the first and second binary structures to determine the indication of the intersection between the first dataset and second dataset.

Embodiments of the invention are directed to a system, method, or computer program product structured for generating resource identification strings to avoid electronic misreads. In some embodiments, the system is structured for generating a new technology resource string of characters, comparing the new string to existing technology resource strings, and determining whether the new string is the same as an existing string. The system is also structured for, in response to determining it is not, for each existing string, pairing characters of the strings and determining whether the strings have at least a threshold number of matching character pairs; if there are, for at least one of the existing strings, determining whether characters of the non-matching pairs are commonly misread characters and determining whether there are a threshold combination of matching/commonly misread pairs; and if there are, discard the new string and generate a second new technology resource string.

Methods and systems for searching directory access groups are disclosed. A set of groups associated with a logon user is determined. The set of groups is partitioned into one or more disjoint subsets, wherein each of the disjoint subsets is represented by a data representation including a root node and one or more intermediate nodes. For each of the disjoint subsets, the disjoint subset is path compressed to flatten a structure of the data representation representing the disjoint subset. The data representation is cached to a database cache.