Sciweavers

861 search results - page 64 / 173
» Information landscapes and the analysis of search algorithms
Sort
View
90
Voted
WWW
2008
ACM
15 years 11 months ago
Using subspace analysis for event detection from web click-through data
Although most of existing research usually detects events by analyzing the content or structural information of Web documents, a recent direction is to study the usage data. In th...
Ling Chen 0002, Yiqun Hu, Wolfgang Nejdl
81
Voted
ATAL
2010
Springer
15 years 1 days ago
TacTex09: a champion bidding agent for ad auctions
In the Trading Agent Competition Ad Auctions Game, agents compete to sell products by bidding to have their ads shown in a search engine's sponsored search results. We report...
David Pardoe, Doran Chakraborty, Peter Stone
WWW
2009
ACM
15 years 11 months ago
Graph based crawler seed selection
This paper identifies and explores the problem of seed selection in a web-scale crawler. We argue that seed selection is not a trivial but very important problem. Selecting proper...
Shuyi Zheng, Pavel Dmitriev, C. Lee Giles
88
Voted
EUSFLAT
2003
108views Fuzzy Logic» more  EUSFLAT 2003»
15 years 9 days ago
Soft computing and control of district heating system
The article deals with the possible methodology of processing of data and information for the search of prediction of heat supply daily diagram (HSDD). The methodology includes te...
Petr Dostál, Bronislav Chramcov, Jaroslav B...
INFORMATICALT
2006
88views more  INFORMATICALT 2006»
14 years 11 months ago
Improving the Performances of Asynchronous Algorithms by Combining the Nogood Processors with the Nogood Learning Techniques
Abstract. The asynchronous techniques that exist within the programming with distributed constraints are characterized by the occurrence of the nogood values during the search for ...
Ionel Muscalagiu, Vladimir Cretu