This paper presents a study on the transfer of learned control knowledge between two different planning techniques. We automatically learn heuristics (usually, in planning, heuristics are also named control knowledge) from one planner search process and apply them to a different planner. The goal is to improve this second planner efficiency solving new problems, i.e. to reduce computer resource...

This paper focuses on selection techniques for best correction of misspelt words at the lexical level. Spelling errors are introduced by either cognitive or typographical mistakes. A robust spelling correction algorithm is needed to cover both cognitive and typographical errors. For the most effective spelling correction system, various strategies are considered in this paper: ranking heuristic...

This paper investigates the search performances of various meta-heuristics (MHs) for solving truss mass minimisation with dynamic constraints. Several established MHs were used to solve five truss optimisation problems. The results obtained from using the various MHs were statistically compared based upon convergence rate and consistency. It was found that the best optimisers for this design ta...

Abstract Every year, new ontology matching approaches have been published to address the heterogeneity problem in ontologies. It is well known that no one able stand out from others all aspects. An meta-matcher combines different alignment techniques explore various aspects of avoid performance being restricted some characteristics. The meta-matching process consists several stages execution, a...

We present a general framework for developing search heuristics for automated theorem provers. This framework allows for the construction of heuristics that are on the one hand able to replay (parts of) a given proof found in the past but are on the other hand exible enough to deviate from the given proof path in order to solve similar proof problems. We substantiate the abstract framework by t...

The offline 2D bin packing problem (2DBPP) is an NP-hard combinatorial optimization problem in which objects with various width and length sizes are packed into minimized number of 2D bins. Various versions of this well-known industrial engineering problem can be faced frequently. Several heuristics have been proposed for the solution of 2DBPP but it has not been possible to find the exact solu...

  This paper proposes two relax and fix heuristics for the simultaneous lot sizing and sequencing problem in permutation flow shops involving sequence-dependent setups and capacity constraints. To evaluate the effectiveness of mentioned heuristics, two lower bounds are developed and compared against the optimal solution. The results of heuristics are compared with the selected lower bound .