The Heuristic Polynomial GCD procedure (GCDHEU) is used by the Maple computer algebra system, but no other. Because Maple has an especially eecient kernel that provides fast integer arithmetic, but a relatively slower interpreter for non-kernel code, the GCDHEU routine is especially eeective in that it moves much of the computation into \bignum" arithmetic and hence executes primarily in the ke...

There are exact and heuristic algorithms for solving the MKP. Solution quality and time complexity are two main differences among exact and heuristic algorithms. Solution quality is a measure of how close we are from the optimal point and time complexity is a measure of the required time to reach such point. The purpose of this paper is to report the solution quality obtained from the evaluatio...

This paper proposes a domain independent heuristic for state space planning, which is based on action evaluation. The heuristic obtains estimates for the cost of applying each action of the domain by performing a forward search in a relaxed version of the initial problem. The estimates for the actions are then utilized in a backward search on the original problem. The heuristic, which has been ...

In the past several years, significant progress has been made in finding optimal solutions to combinatorial problems. In particular, random instances of both Rubik’s Cube, with over 10 19 states, and the 5 5 sliding-tile puzzle, with almost 10 states, have been solved optimally. This progress is not the result of better search algorithms, but more effective heuristic evaluation functions. In ad...

the task of balancing of assembly lines is well-known in mass production system but this problem is np-hard even for the simple straight line. therefore, utilizing heuristic methods for these problems is totally unquestionable. furthermore, in line with balancing problems, heuristic methods are the foundation of the metaheuristic methods, thus it seems to be necessary to use more efficient heur...

Recent work has shown that SAT can be theoretically more powerful than heuristic search provided the heuristic used by search is implemented as a set of clauses on which unit propagation simulates the evaluation of the heuristic. The h heuristic has been shown to be implemented trivially by the empty set of clauses. This paper presents an implementation of h, a generalization of h.