31 results about "Heuristics" patented technology

An optimization framework to find the periodic inspection interval over an infinite time horizon for geo-distributed infrastructure systems subject to hidden failures. The unit's failure can only be rectified at periodic inspection, at which point a failed unit will be considered as being “perfectly” repaired. For geo-distributed infrastructure systems, for example, fire hydrants in a city, water and power supply networks in urban areas, firstly, the units of a system are clustered into groups. Then, the optimal inspection interval is calculated for each group based on the expected cost per cycle. Finally, the best schedule for inspection is determined. This schedule: (i) minimizes the global system inspection and maintenance cost; and (ii) meets the applicable labor and budget resource constraints. An integer nonlinear programming formulation together with a heuristics deals with the inspection schedule.

Systems and methods can suggest applications for use by a user of a computing device. The suggestions can be provided on a user interface for the user to select. A suggestion engine can use historical user interactions and contextual data to derive features for a machine learning mode. The machine learning model can determine which application to suggest according to the current context. Multiple models, such as a pattern model and a heuristics model, may be user to generate features for the machine learning model based in user interactions.

Certain example embodiments relate to techniques for generating reassemblable disassemblies of binaries using declarative logic. A declarative logic programming language (e.g., Datalog) is used to compile reverse engineering, binary analysis, and disassembly rules into a format applicable to an executable program, yielding disassembly of that program. Datalog, for example, can be used as a query language for deductive databases, to facilitate this approach. Certain example embodiments thus involve (1) preparation of an executable for Datalog analysis, (2) inference rules and the application of Datalog for program analysis, including the application of Datalog to the domain of binary reverse engineering and analysis, and (3) the collection of assembly code from the results of the Datalog analysis. These rules can include both “hard rules” and “soft rules” or heuristics, even though standard Datalog does not support the latter.

Systems and methods for maintaining the safety of a software-based system. One method includes automatically generating a first artifact tree for a hazard for a first version of the system and automatically transforming the first artifact tree into a first augmented tree using a set of heuristics. The method also includes automatically generating a second artifact tree for the hazard for a second version of the system and automatically transforming the second artifact tree for the hazard into a second augmented tree using the set of heuristics. The method further includes automatically comparing the first augmented tree and the second augmented tree to generate a delta view, and automatically generating, based on the delta view, at least one selected from a group consisting of a safety warning for the second version of the software-based system and an actionable recommendation to maintain safety of the second version of the software-based system.

The invention relates to automatically generate and apply graphical user interface resize-contraints based on design semantics. The present disclosure is directed toward systems, methods, and non-transitory computer readable media that resize a graphical user interface design layout using automatically-generated semantic-aware resize constraints. In particular, systems described herein can analyzethe semantics of graphical user interface design elements (e.g., including size, position, type, etc.) and relative positions of the design elements (e.g., hierarchy, offsets, nesting, etc.). The disclosed systems utilizes a heuristics system to the analyzed semantics to generate a set of automatically-defined semantic-aware resize constraints for each graphical user interface design interface. The disclosed systems additionally present a design resize interface that enables designer to manually select constraints to be applied to the design elements. The disclosed systems can toggle betweenapplying manually-selected and automatic semantic-aware resize constraints for the design elements.

The invention discloses a GTSP solving algorithm based on adaptive large field search. The GTSP solving algorithm comprises an ALFG algorithm, wherein the ALFG algorithm fuses an intra-group point updating strategy in the solution of the ant colony algorithm into the adaptive large neighborhood search, so that the structure of the solution adapts to the requirements of the solution of the heuristic algorithm; on the basis of E-GTSP, new heuristics of update-worst removal, update-optimal insertion and dynamic multi-point removal are provided, and a new adaptive strategy is provided for the problem of scale change of weight in the algorithm iteration process. The invention provides a GTSP solving algorithm based on adaptive large-field search, which can effectively improve the solving efficiency of a larger-scale problem.

A computer-implemented method for planning an operation of a technical system within its environment. The method includes: obtaining state information comprising: a current domain, a time step and a current state; determining by heuristics costs for reachable states from the current state; selecting a heuristics by a policy out of a set of predefined heuristics depending on the state information and costs; choosing the state with the lowest cost returned by the selected heuristic from the reachable states, and determining an operation of the technical system out of the set of possible operation that has to be carried out by the technical system to reach said state with the lowest costreturned by the selected heuristic.

Various embodiments provide an ability to detect an input associated with an element for which a cascading operation has been defined. Some embodiments apply the cascading operation to the element, and further apply one or more cascading operations to less than all ancestral elements in an associated tree for which cascading operations have been defined. In some cases, the one or more cascading operations can be applied to one or more respective ancestral elements after a predefined waiting period.

The invention discloses a branch heuristic variable element assignment optimization algorithm and a Boolean satisfiability verification algorithm. According to the assignment optimization algorithm for the branch heuristic variables, at least one variable is assigned by adopting the following assignment steps: carrying out first assignment on a variable to be assigned; calculating a first time when the variable element to be assigned has n conflicts in branch heuristics after assignment; negating the value of the first assignment and carrying out second assignment on the variable to be assigned by using the negated value; calculating second time of n conflicts of the variables to be assigned in branch heuristics after assignment; and comparing the first time with the second time, and selecting the value of the assignment with the short time to assign the variable to be assigned. According to the invention, the calculation time of the branch heuristic algorithm can be shortened.