Sciweavers

6036 search results - page 154 / 1208
» Web search solved
Sort
View
DSS
2007
122views more  DSS 2007»
15 years 5 months ago
A stochastic beam search for the berth allocation problem
Abstract. In this paper, the optimization of the Berth Allocation Problem (BAP) is transformed into a multiple stage decision making procedure and a new stochastic beam search algo...
Fan Wang, Andrew Lim
HEURISTICS
2002
122views more  HEURISTICS 2002»
15 years 5 months ago
Complete Local Search with Memory
Neighborhood search heuristics like local search and its variants are some of the most popular approaches to solve discrete optimization problems of moderate to large size. Apart ...
Diptesh Ghosh, Gerard Sierksma
IADIS
2004
15 years 7 months ago
Visualization of Web link space for neighboring search
We use the neighboring search that we have proposed and propose a visualization technique for this retrieval result. The whole retrieval result of a neighboring search becomes eas...
Hidetomo Miyahara, Aki Kobayashi, Katsunori Yamaok...
SIGIR
2002
ACM
15 years 5 months ago
A taxonomy of web search
: Classic IR (information retrieval) is inherently predicated on users searching for information, the socalled "information need". But the need behind a web search is oft...
Andrei Z. Broder
WWW
2003
ACM
16 years 6 months ago
Using Top-Ranking Sentences for Web Search Result Presentation
In this poster we propose a granular approach for presenting web search results. Sentences, taken from the top documents, are used as fine-grained representations of document cont...
Ryen W. White, Joemon M. Jose, Ian Ruthven