This paper presents a new context-based method for automatic detection and extraction of similar and related words from texts. Finding similar words is a very important task for m...
Recently, a number of programs have been developed that successfully apply variable-depth search to find solutions for mating problems in Japanese chess, called tsume shogi. Public...
-A large number of studies on Genetic Algorithms (GAs) emphasize finding a globally optimal solution. Some other investigations have also been made for detecting multiple solutions...
Anytime search algorithms solve optimisation problems by quickly finding a usually suboptimal solution and then finding improved solutions when given additional time. To deliver a...
In this work we explore how the complexity of a problem domain affects the performance of evolutionary search using a performance-based restart policy. Previous research indicates...