Sciweavers

868 search results - page 84 / 174
» A general compression algorithm that supports fast searching
Sort
View
ATAL
2010
Springer
13 years 10 months ago
Asynchronous algorithms for approximate distributed constraint optimization with quality bounds
Distributed Constraint Optimization (DCOP) is a popular framework for cooperative multi-agent decision making. DCOP is NPhard, so an important line of work focuses on developing f...
Christopher Kiekintveld, Zhengyu Yin, Atul Kumar, ...
CIKM
2008
Springer
13 years 11 months ago
Mining term association patterns from search logs for effective query reformulation
Search engine logs are an emerging new type of data that offers interesting opportunities for data mining. Existing work on mining such data has mostly attempted to discover knowl...
Xuanhui Wang, ChengXiang Zhai
GECCO
2011
Springer
264views Optimization» more  GECCO 2011»
13 years 16 days ago
Critical factors in the performance of novelty search
Novelty search is a recently proposed method for evolutionary computation designed to avoid the problem of deception, in which the fitness function guides the search process away...
Steijn Kistemaker, Shimon Whiteson
SIGIR
2004
ACM
14 years 2 months ago
Learning effective ranking functions for newsgroup search
Web communities are web virtual broadcasting spaces where people can freely discuss anything. While such communities function as discussion boards, they have even greater value as...
Wensi Xi, Jesper Lind, Eric Brill
WWW
2006
ACM
14 years 9 months ago
The SOWES approach to P2P web search using semantic overlays
Peer-to-peer (P2P) Web search has gained a lot of interest lately, due to the salient characteristics of P2P systems, namely scalability, fault-tolerance and load-balancing. Howev...
Christos Doulkeridis, Kjetil Nørvåg, ...