Critic-proofing is a modified heuristic evaluation technique, specifically designed to provide a fine-grained, prioritized list of heuristic violations. The critic-proofing technique weights the severity of a problem based on the frequency that similar problems are found in similar games. The severity ratings are calculated using data collected from game reviews, and the severity assigned to a ...

Abstract Maximum likelihood estimation (MLE) is an effective method for localizing radioactive sources in a given area. However, it requires exhaustive search parameter estimation, which time-consuming. In this study, heuristic techniques were employed to radiation source parameters that provide the maximum by using network of sensors. Hence, time consumption MLE would be effectively reduced. F...

STEPS TOWARDS A SCIENCE OF HEURISTIC SEARCH by Christopher Makoto Wilt University of New Hampshire, May, 2014 Heuristic search is one of the most important graph search techniques, allowing people to find paths through graphs that can have more nodes than there are atoms in the universe. There has been much research in developing heuristic search algorithms, but much less work on when and why t...

Many authors have examined lot sizing, scheduling and sequence of multi-product flow shops, but most of them have assumed that set up times are independent of sequence. Whereas dependence of set up times to sequence is more common in practice. Hence, in this paper, we examine the discussed problem with hypothesis of dependence of set up times to sequence and cyclic schedule policy in basic peri...

a real-time optimization (rto) strategy incorporating the fuzzy sets theory is developed, where the problem constraints obtained from process considerations are treated in fuzzy environment. furthermore, the objective function is penalized by a fuzzified form of the key process constraints. to enable using conventional optimization techniques, the resulting fuzzy optimization problem is then re...

Artificial intelligence (AI) is an area of computer science that highlights the creation of machines that are intelligent, also they work and react like humans. Since AI problems are complex and cannot be solved with direct techniques we resort to heuristic search techniques. Heuristic search technique is any approach to problem solving, learning, or discovery which uses a practical methodology...

today, with rapid growth of the world wide web and creation of internet sites and online text resources, text summarization issue is highly attended by various researchers. extractive-based text summarization is an important summarization method which is included of selecting the top representative sentences from the input document. when, we are facing into large data volume documents, the extr...

numerous problems encountered in real life cannot be actually formulated as a single objective problem; hence the requirement of multi-objective optimization (moo) had arisen several years ago. due to the complexities in such type of problems powerful heuristic techniques were needed, which has been strongly satisfied by swarm intelligence (si) techniques. particle swarm optimization (pso) has ...

Heuristic forward search is the dominant approach to satisficing planning to date. Most successful planning systems, however, go beyond plain heuristic search by employing various search-enhancement techniques. One example is the use of helpful actions or preferred operators, providing information which may complement heuristic values. A second example is deferred heuristic evaluation, a search...