2252 search results - page 54 / 451 » Improving Random Forests |
GECCO
2000
Springer
13 years 11 months ago
2000
Springer
We present an "adaptive multi-start" genetic algorithm for the Euclidean traveling salesman problem that uses a population of tours locally optimized by the Lin-Kernigha...
CIKM
2010
Springer
13 years 6 months ago
2010
Springer
Dealing with verbose (or long) queries poses a new challenge for information retrieval. Selecting a subset of the original query (a "sub-query") has been shown to be an ...
CIS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. As a novel research direction, privacy-preserving data mining (PPDM) has received a great deal of attentions from more and more researchers, and a large number of PPDM al...
ICMCS
2008
IEEE
14 years 2 months ago
2008
IEEE
As an important attribute directly influencing the steganographic scheme, the embedding efficiency is defined as the average number of random data bits per one embedding change...
FOCS
2006
IEEE
14 years 2 months ago
2006
IEEE
In this paper we introduce a new general framework for set covering problems, based on the combination of randomized rounding of the (near-)optimal solution of the Linear Programm...