775 search results - page 133 / 155 » Algorithm Selection via Ranking |
COMAD
2009
13 years 9 months ago
2009
We present a class of web queries whose result is a multi-column relation instead of a collection of unstructured documents as in standard web search. The user specifies the query...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
: A local search algorithm operating on an instance of a Boolean constraint satisfaction problem (in particular, k-SAT) can be viewed as a stochastic process traversing successive ...
BMCBI
2007
13 years 8 months ago
2007
Background: Mean-based clustering algorithms such as bisecting k-means generally lack robustness. Although componentwise median is a more robust alternative, it can be a poor cent...
ICML
2000
IEEE
14 years 9 months ago
2000
IEEE
Eligibility traces have been shown to speed reinforcement learning, to make it more robust to hidden states, and to provide a link between Monte Carlo and temporal-difference meth...
GECCO
2005
Springer
14 years 2 months ago
2005
Springer
We focus on the handling of overlapping solutions in evolutionary multiobjective optimization (EMO) algorithms. First we show that there exist a large number of overlapping soluti...