Sciweavers

10435 search results - page 2042 / 2087
» Measuring system normality
Sort
View
KDD
2010
ACM
252views Data Mining» more  KDD 2010»
14 years 18 days ago
Fast query execution for retrieval models based on path-constrained random walks
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...
Ni Lao, William W. Cohen
KDD
2010
ACM
199views Data Mining» more  KDD 2010»
14 years 18 days ago
Overlapping experiment infrastructure: more, better, faster experimentation
At Google, experimentation is practically a mantra; we evaluate almost every change that potentially affects what our users experience. Such changes include not only obvious user-...
Diane Tang, Ashish Agarwal, Deirdre O'Brien, Mike ...
SIGIR
2010
ACM
14 years 18 days ago
The importance of anchor text for ad hoc search revisited
It is generally believed that propagated anchor text is very important for effective Web search as offered by the commercial search engines. “Google Bombs” are a notable illus...
Marijn Koolen, Jaap Kamps
ATAL
2006
Springer
14 years 14 days ago
Examining DCSP coordination tradeoffs
Distributed Constraint Satisfaction Problems (DCSPs) provide a model to capture a broad range of cooperative multiagent problem solving settings. Researchers have generally propos...
Michael Benisch, Norman M. Sadeh
ATAL
2006
Springer
14 years 14 days ago
Learning to commit in repeated games
Learning to converge to an efficient, i.e., Pareto-optimal Nash equilibrium of the repeated game is an open problem in multiagent learning. Our goal is to facilitate the learning ...
Stéphane Airiau, Sandip Sen
« Prev « First page 2042 / 2087 Last » Next »