Sciweavers

3422 search results - page 94 / 685
» Random Subset Optimization
Sort
View
DAGSTUHL
2004
15 years 3 months ago
Optimal algorithms for global optimization in case of unknown Lipschitz constant
We consider the global optimization problem for d-variate Lipschitz functions which, in a certain sense, do not increase too slowly in a neighborhood of the global minimizer(s). O...
Matthias U. Horn
139
Voted
CORR
2010
Springer
182views Education» more  CORR 2010»
15 years 2 months ago
SPOT: An R Package For Automatic and Interactive Tuning of Optimization Algorithms by Sequential Parameter Optimization
The sequential parameter optimization (spot) package for R (R Development Core Team, 2008) is a toolbox for tuning and understanding simulation and optimization algorithms. Model-...
Thomas Bartz-Beielstein
122
Voted
ICDM
2007
IEEE
148views Data Mining» more  ICDM 2007»
15 years 6 months ago
Sample Selection for Maximal Diversity
The problem of selecting a sample subset sufficient to preserve diversity arises in many applications. One example is in the design of recombinant inbred lines (RIL) for genetic a...
Feng Pan, Adam Roberts, Leonard McMillan, David Th...
132
Voted
SAGA
2005
Springer
15 years 8 months ago
Two Metaheuristics for Multiobjective Stochastic Combinatorial Optimization
Two general-purpose metaheuristic algorithms for solving multiobjective stochastic combinatorial optimization problems are introduced: SP-ACO (based on the Ant Colony Optimization ...
Walter J. Gutjahr
IJCAI
2007
15 years 4 months ago
Concept Sampling: Towards Systematic Selection in Large-Scale Mixed Concepts in Machine Learning
This paper addresses the problem of concept sampling. In many real-world applications, a large collection of mixed concepts is available for decision making. However, the collecti...
Yi Zhang 0010, Xiaoming Jin