Sciweavers

5316 search results - page 227 / 1064
» Which Search Problems Are Random
Sort
View
NIPS
2003
15 years 5 months ago
Policy Search by Dynamic Programming
We consider the policy search approach to reinforcement learning. We show that if a “baseline distribution” is given (indicating roughly how often we expect a good policy to v...
J. Andrew Bagnell, Sham Kakade, Andrew Y. Ng, Jeff...
SYRCODIS
2007
92views Database» more  SYRCODIS 2007»
15 years 5 months ago
A Method for Evaluating Full-text Search Queries in Native XML Databases
In this paper we consider the problem of efficiently producing results for full-text keyword search queries over XML documents. We describe full-text search query semantics and pr...
Roman Pastukhov
RECOMB
2007
Springer
16 years 4 months ago
Minimizing and Learning Energy Functions for Side-Chain Prediction
Abstract. Side-chain prediction is an important subproblem of the general protein folding problem. Despite much progress in side-chain prediction, performance is far from satisfact...
Chen Yanover, Ora Schueler-Furman, Yair Weiss
GECCO
2005
Springer
154views Optimization» more  GECCO 2005»
15 years 10 months ago
Genetic algorithms using low-discrepancy sequences
The random number generator is one of the important components of evolutionary algorithms (EAs). Therefore, when we try to solve function optimization problems using EAs, we must ...
Shuhei Kimura, Koki Matsumura
CIKM
2010
Springer
15 years 3 months ago
Novel local features with hybrid sampling technique for image retrieval
In image retrieval, most existing approaches that incorporate local features produce high dimensional vectors, which lead to a high computational and data storage cost. Moreover, ...
Leszek Kaliciak, Dawei Song, Nirmalie Wiratunga, J...