3223 search results - page 166 / 645 » The Scaling of Search Cost |
167
click to vote
CSCLP
2004
Springer
15 years 12 months ago
2004
Springer
We propose an improved restart strategy for randomized backtrack search, and evaluate its performance by comparing to other heuristic and stochastic search techniques for solving r...
192
click to vote
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
Learning-to-rank algorithms, which can automatically adapt ranking functions in web search, require a large volume of training data. A traditional way of generating training examp...
165
click to vote
ACSAC
2007
IEEE
16 years 26 days ago
2007
IEEE
We propose a taxonomy of botnet structures, based on their utility to the botmaster. We propose key metrics to measure their utility for various activities (e.g., spam, ddos). Usi...
180
click to vote
DICTA
2009
15 years 4 months ago
2009
A number of problems in computer vision require the estimation of a set of matrices, each of which is defined only up to an individual scale factor and represents the parameters of...
150
click to vote
ATAL
2010
Springer
15 years 6 months ago
2010
Springer
Distributed Constraints Optimization (DCOP) is a powerful framework for representing and solving distributed combinatorial problems, where the variables of the problem are owned b...