A heuristic improvement technique referred to as multi-dimensional heuristics is presented. Instead of only applying the heuristic between two states X 1 and X 2 , when a distance esti­ mate of X 1 X 2 is needed, this technique uses a reference state R and applies the heuristic func­ tion to {X 1 ,R) and (X' 2 ,R) and compares the resulting values. If two states are close to each other, then th...

A path in a classical planning problem is a sequence of causal links ai, pi, ai+1 that connects a given state with the goal. C3 is a recent based planner that computes paths from the initial state and uses them to recursively decompose the problem into subproblems (Lipovetzky and Geffner 2009). Paths are ranked with an heuristic that takes deletes into account and is built on top of a base heur...

This paper introduces Gene-Machine, an efficient and new search heuristic algorithm, based in the building-block hypothesis [1] [2]. It is inspired by natural evolution, but does not use some of the concepts present in genetic algorithms like population, mutation and generation. This heuristic exhibits good performance in comparison with genetic algorithms, and can be used to generate useful so...

We define a new heuristic hDS for ASP, and implement it in the (disjunctive) ASP system DLV. The new heuristic improves the evaluation of Σ2 /Π P 2 hard ASP programs while maintaining the benign behaviour of the well-assessed heuristic of DLV on NP problems. We experiment with the new heuristic on QBFs. hDS significantly outperforms the heuristic of DLV on hard 2QBF problems. We compare also th...

Frequency response diagrams of a system include detailed and recognizable information about the structural and parameter effects of the transfer function model of the system. The information are qualitatively and quantitatively obtainable from simultaneous consideration of amplitude ratio and phase information. In this paper, some rules and relationships are presented for making use of frequenc...

Well-known algorithms for the evaluation of the minimax function in game trees are alpha-beta Knuth] and SSS* Stockman]. An improved version of SSS* is SSS-2 Pijls-1]. All these algorithms don't use any heuristic information on the game tree. In this paper the use of heuristic information is introduced into the alpha-beta and the SSS-2 algorithm. Extended versions of these algorithms are presen...

in this paper, a stochastic multi-depot multi-objective vehicle routing problem (vrp) is studied. based on observations in real-world problems, we develop an aspect of the problem, such as stochastic availability of routes. to solve the problem in this situation, a two-objective mathematical model is developed, in which the related objective functions are: (1) minimizing transportation costs an...

barrel vaults are attractive space structures that cover large area without intermediate supports. in this paper, the charged search system (css) optimization algorithm is employed for optimal design of barrel vaults. this method utilizes the governing laws of coulomb and gauss from electrostatics and the newtonian law of mechanics. the results demonstrate the efficiency of the discrete css alg...