Graph searching games have been extensively studied in the past years. The graph searching problem involves a team of searchers who are attempting to capture a fugitive moving alon...
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
stractions are extensively used to understand and solve challenging computational problems in various scientific and engineering domains. They have particularly gained prominence...
Martinetz and Schulten proposed the use of a Competitive Hebbian Learning (CHL) rule to build Topology Representing Networks. From a set of units and a data distribution, a link i...
In this paper we consider the problem of using disk blocks efficiently in searching graphs that are too large to fit in internal memory. Our model allows a vertex to be represented...
Mark H. Nodine, Michael T. Goodrich, Jeffrey Scott...