In this paper we propose a new hybrid heuristic for solving 0-1 mixed integer programs based on the principle of variable neighbourhood decomposition search. It combines variable ...
The World Wide Web is growing at such a pace that even the biggest centralized search engines are able to index only a small part of the available documents on the Internet. The d...
The social impact from the World Wide Web cannot be underestimated, but technologies used to build the Web are also revolutionizing the sharing of business and government informat...
Ronald Fagin, Ravi Kumar, Kevin S. McCurley, Jasmi...
– A problem of searching with multiple searchers and scouts is presented. Unlike most search problems that terminate as soon as the target is found, successful detections by scou...
Local search techniques have attracted considerable interest in the Artificial Intelligence (AI) community since the development of GSAT [9] and the min-conflicts heuristic [5] ...
John Thornton, Matthew Beaumont, Abdul Sattar, Mic...