A significant challenge in genetic programming is premature convergence to local optima, which often prevents evolution from solving problems. This paper introduces to genetic pro...
Abstract-- The dynamics of exploration vs exploitation decisions are explored in the context of robotic search problems. Building on prior work on robotic search together with our ...
We study the problem of minimizing the expected cost of binary searching for data where the access cost is not fixed and depends on the last accessed element, such as data stored i...
Gonzalo Navarro, Ricardo A. Baeza-Yates, Eduardo F...
We are reviewing recent advances in the run time analysis of search tree algorithms, including indications to open problems. In doing so, we also try to cover the historical dimens...
We present a formalism that is able to cope with search and congestion simultaneously. This formalism avoids the problem of simulating the dynamics of the search-communication proc...