Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a value selection heuristic makes a correct prediction. We provide an extensive empirical evaluation of value selection heuristics for knapsack problems. We investigate how the accuracy of search heuristics varies as a fu...

We present a cost-directed heuristic planning algorithm, which uses an A strategy for node selection. The heuristic evaluation function is computed by a deep lookahead that calculates the cost of complete plans for a set of pre-de ned top-level subgoals, under the (generally false) assumption that they do not interact. This approach leads to nding low-cost plans, and in many circumstances it al...

This article presents the results of experiments designed to gain insight into the effect of the minimax algorithm on the error of a heuristic evaluation function. Two types of effect of minimax are considered: (a) evaluation accuracy (are the minimax backed-up values more accurate than the heuristic values themselves?), and (b) decision accuracy (are moves played by deeper minimax search bette...

Among the many information literacy games that have been developed, evaluations have mostly relied on anecdotal quotations, or procedures which were neither systematic nor rigorous. This study adopted the heuristic evaluation method with end-users to evaluate an information literacy game for tertiary students. Participants identified problems with the game according to the Heuristic Evaluation ...

The main purpose of the study is to evaluate the heuristic inspection of children’s authoring tools to develop games. The researcher has selected 15 authoring tools for making games specifically for educational purposes. Nine students from Diploma of Game Design and Development course and four lecturers from the computing department involved in this evaluation. A set of usability heuristic chec...

Though empirical testing is broadly used to evaluate heuristics, there are shortcomings with how it is often applied in practice. In a systematic review of Max-Cut and Quadratic Unconstrained Binary Optimization (QUBO) heuristics papers, we found only 4% publish source code, only 14% compare heuristics with identical termination criteria, and most experiments are performed with an artificial, h...

This paper reports an evolutionary meta-heuristic incorporating fuzzy evaluation for some large-scale set covering problems originating from the public transport industry. First, five factors characterized by fuzzy membership functions are aggregated to evaluate the structure and generally the goodness of a column. This evaluation function is incorporated into a refined greedy algorithm to make...

The rapid developments in technology make the information spread faster, especially electronic sports industry (eSports). Game tournament is essential to gamers since they strive obtain accurate and easy-to-understand about esports. GGWP Tourney application a mobile that provides means purchase e-sports competitions online. However, still development stage so there are many user experience prob...

In constraint satisfaction, local search is an incomplete method for finding a solution to a problem. Solving a general constraint satisfaction problem (CSP) is known to be NP-complete; so that heuristic techniques are usually used. The main contribution of this work is twofold: (i) a technique for de-composing a CSP into a DFS-tree CSP structure; (ii) an heuristic search technique for solving ...