3055 search results - page 334 / 611 » Randomized Search Trees |
77
Voted
ECAI
2006
Springer
15 years 7 months ago
2006
Springer
In this paper, we propose an approach to guide search to sources of conflicts. The principle is the following: the last variable involved in the last conflict is selected in priori...
163
Voted
BIBM
2009
IEEE
15 years 7 months ago
2009
IEEE
—We consider the problem of identifying motifs, recurring or conserved patterns, in the sets of biological sequences. To solve this task, we present new deterministic and exact a...
111
Voted
AAAI
2006
15 years 5 months ago
2006
Much of the work on opponent modeling for game tree search has been unsuccessful. In two-player, zero-sum games, the gains from opponent modeling are often outweighed by the cost ...
108
Voted
MST
2006
15 years 3 months ago
2006
An array of n distinct keys can be sorted for logarithmic searching or can be organized as a heap for logarithmic updating, but it is unclear how to attain logarithmic time for bo...
117
Voted
ICML
2008
IEEE
16 years 4 months ago
2008
IEEE
In this paper we perform an empirical evaluation of supervised learning on highdimensional data. We evaluate performance on three metrics: accuracy, AUC, and squared loss and stud...