The formulation of planning as heuristic search with heuristics derived from problem representations has turned out to be a fruitful approach for classical planning. In this paper...
We consider the problem of implementing nger search trees on the pointer machine, i.e., how to maintain a sorted list such that searching for an element x, starting the search at ...
In this paper, we present the parallelization of tabu search on a network of workstations using PVM. Two parallelization strategies are integrated: functional decomposition strate...
Ahmad A. Al-Yamani, Sadiq M. Sait, Habib Youssef, ...
Effective keyword search on image databases is a major open problem, due to the inherent imprecision of keywords (tags) used to describe images' content. In this paper we pre...
Here we present a first study of search spaces and fitness landscapes in the context of the evolution of quantum programs. We consider small instances of the Deutsch-Jozsa proble...