Buscar
Mostrando ítems 11-20 de 23059
Avoiding and escaping depressions in real-time heuristic search
(Journal OF Artificial Intelligence Research, 2015)
How to tune the RBF SVM hyperparameters? An empirical evaluation of 18 search algorithms
(Springer, 2021)
SVM with an RBF kernel is usually one of the best classification algorithms for most data sets, but it is important to tune the two hyperparameters C and γ to the data itself. In general, the selection of the hyperparameters ...
A search-theoretic explanation for the negative correlation between labor income and impatience
(Escola de Pós-Graduação em Economia da FGV, 2004-08-01)
Lawrance (1991) has shown, through the estimation of consumption Euler equations, that subjective rates of impatience (time preference) in the U.S. are three to Öve percentage points higher for households with lower average ...
Optimum-Path Forest pruning parameter estimation through Harmony Search
(2011-12-01)
Pattern recognition in large amount of data has been paramount in the last decade, since that is not straightforward to design interactive and real time classification systems. Very recently, the Optimum-Path Forest ...
Adaptive granular local search heuristic for a dynamic vehicle routing problem
(Pergamon-elsevier Science LtdOxfordInglaterra, 2009)
Performance guarantees of local search for minsum scheduling problems
(Springer, 2020)
We study the worst-case performance guarantee of locally optimal solutions for the problem of minimizing the total weighted and unweighted completion time on parallel machine environments. Our method makes use of a mapping ...
Optimizing response time in large scale similarity searches
(Universidade Federal de Minas GeraisBrasilICX - DEPARTAMENTO DE CIÊNCIA DA COMPUTAÇÃOPrograma de Pós-Graduação em Ciência da ComputaçãoUFMG, 2020-03-13)
Similarity search is a core operation found in several online multimedia services. These
services have to handle very large databases, while, at the same time, they must min imize the query response times observed by ...
A tabu search heuristic for the multiprocessor scheduling problem with sequence dependent setup times
(Elsevier Science BvAmsterdamHolanda, 1996)