The constraint satisfaction problem, the Boolean satisfiability problem and the graph isomorphism problem do not have efficient algorithms. In order to solve these problems, one utilizes heuristic algorithms of polynomial running time. The present thesis studies three classical heuristics for the above-mentioned decision problems and answers the question whether they can be implemented more eff...

different manufacturing enterprises use regularly scheduling algorithms in order to help meeting demands over time and reducing operational costs. nowadays, for a better useofresources and manufacturingin accordance withcustomer needs and given the level ofcompetitionbetweencompanies, employing asuitablescheduling programhasa double importance. conventional productionmethods are constantly subs...

Genetic algorithms GAs and heuristic search are shown to be structurally similar The strength of the correspondence and its prac tical consequences are demonstrated by considering the relationship between tness functions in GAs and the heuristic functions of AI By examining the extent to which tness functions approximate an AI ideal a measure of GA search di culty is de ned and applied to previ...

Nowadays computers are used to solve incredibly complex problems. But in order to manage with a problem we should develop an algorithm. Sometimes the human brain is not able to accomplish this task. Moreover, exact algorithms might need centuries to manage with formidable challenges. In such cases heuristic algorithms that find approximate solutions but have acceptable time and space complexity...

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...

Attribute reduction is one of the most important topics in rough set theory. Heuristic attribute reduction algorithms have been presented to solve the attribute reduction problem. It is generally known that fitness functions play a key role in developing heuristic attribute reduction algorithms. The monotonicity of fitness functions can guarantee the validity of heuristic attribute reduction al...

In recent years backtrack search SAT solvers have been the subject of dramatic improvements. These improvements allowed SAT solvers to successfully replace BDDs in many areas of formal verification, and also motivated the development of many new challenging problem instances, many of which too hard for the current generation of SAT solvers. As a result, further improvements to SAT technology ar...