Troubleshooting in Mechanics: A Heuristic Matching Process

A Heuristic Process for GUI Widget Matching Across Application Versions

This paper introduces an automated heuristic process able to achieve high accuracy when matching graphical user interface widgets across multiple versions of a target application. The proposed implementation is flexible as it allows full customization of the process and easy integration with existing tools for long term graphical user interface test case maintenance, software visualization and ...

A Heuristic for Near-Optimal Troubleshooting Using AO*

When troubleshooting malfunctioning technical equipment, the task is to locate faults and make repairs until the equipment functions properly again. The AO* algorithm can be used to find troubleshooting strategies that are optimal in the sense that the expected cost of repair is minimal. We have adapted the AO* algorithm for troubleshooting in the automotive domain with limited time. We propose...

A Fast Heuristic for Exact String Matching

Given a pattern string P of length n consisting of δ distinct characters and a query string T of length m, where the characters of P and T are drawn from an alphabet Σ of size ∆, the exact string matching problem consists of finding all occurrences of P in T . For this problem, we present a randomized heuristic that in O(nδ) time preprocesses P to identify sparse(P ), a rarely occurring substri...

A Heuristic for Moment-Matching Scenario Generation

A Fast Heuristic forApproximate String Matching 2

We study a fast algorithm for on-line approximate string matching. It is based on a non-deterministic nite automaton, which is simulated using bit-parallelism. If the automaton does not t in a computer word, we partition the problem into subproblems. We show experimentally that this algorithm is the fastest for typical text search. We also show which algorithms are the best in other cases, and ...