Sciweavers

1614 search results - page 131 / 323
» Breadth-First Heuristic Search
Sort
View
COR
2010
166views more  COR 2010»
15 years 4 months ago
Variable neighbourhood decomposition search for 0-1 mixed integer programs
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 ...
Jasmina Lazic, Saïd Hanafi, Nenad Mladenovic,...
FGCS
2008
95views more  FGCS 2008»
15 years 3 months ago
SemreX: Efficient search in a semantic overlay for literature retrieval
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...
Hai Jin, Hanhua Chen
WWW
2003
ACM
16 years 5 months ago
Searching the workplace web
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...
IROS
2007
IEEE
110views Robotics» more  IROS 2007»
15 years 10 months ago
Multi-agent search with interim positive information
– 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...
Haye Lau, Shoudong Huang, Gamini Dissanayake
TIME
2002
IEEE
15 years 9 months ago
Applying Local Search to Temporal Reasoning
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...