Sciweavers

1795 search results - page 110 / 359
» Search by strategy
Sort
View
CONSTRAINTS
2007
122views more  CONSTRAINTS 2007»
15 years 6 months ago
Stochastic Local Search Algorithms for Graph Set T -colouring and Frequency Assignment
The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that co...
Marco Chiarandini, Thomas Stützle
IWPEC
2004
Springer
15 years 11 months ago
Computing Small Search Numbers in Linear Time
Let G = V; E be a graph. The linear-width of G is de ned as the smallest integer k such that E can be arranged in a linear ordering e1; : : : ; er such that for every i = 1; :...
Hans L. Bodlaender, Dimitrios M. Thilikos
CIKM
2008
Springer
15 years 8 months ago
Search-based query suggestion
In this paper, we proposed a unified strategy to combine query log and search results for query suggestion. In this way, we leverage both the users' search intentions for pop...
Jiang-Ming Yang, Rui Cai, Feng Jing, Shuo Wang, Le...
HPDC
2010
IEEE
15 years 7 months ago
New caching techniques for web search engines
This paper proposes a cache hierarchy that enables Web search engines to efficiently process user queries. The different caches in the hierarchy are used to store pieces of data w...
Mauricio Marín, Veronica Gil Costa, Carlos ...
CLEF
2004
Springer
15 years 11 months ago
Data Fusion for Effective European Monolingual Information Retrieval
For our fourth participation in the CLEF evaluation campaigns, our first objective was to propose an effective and general stopword list and a light stemming procedure for the Port...
Jacques Savoy