1940 search results - page 184 / 388 » Optimizing search engines using clickthrough data |
174
click to vote
JMLR
2010
15 years 1 months ago
2010
Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, ...
169
click to vote
DAC
2005
ACM
16 years 7 months ago
2005
ACM
This paper presents the first in-depth study on applying dual Vdd buffers to buffer insertion and multi-sink buffered tree construction for power minimization under delay constrai...
178
click to vote
PDP
2008
IEEE
16 years 25 days ago
2008
IEEE
Search engines use inverted files as index data structures to speed up the solution of user queries. The index is distributed on a set of processors forming a cluster of computer...
179
click to vote
APWEB
2003
Springer
15 years 11 months ago
2003
Springer
Search engines are among the most important applications or services on the web. Most existing successful search engines use global ranking algorithms to generate the ranking of do...
179
click to vote
EOR
2008
15 years 6 months ago
2008
Our problem of interest consists of minimizing a separable, convex and differentiable function over a convex set, defined by bounds on the variables and an explicit constraint des...