Sciweavers

2126 search results - page 24 / 426
» An optimization algorithm for imprecise multi-objective prob...
Sort
View
DAGSTUHL
2004
14 years 11 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
PPSN
1992
Springer
15 years 1 months ago
Nonstationary Function Optimization using the Structured Genetic Algorithm
In this paper, we describe the application of a new type of genetic algorithm called the Structured Genetic Algorithm (sGA) for function optimization in nonstationary environments...
Dipankar Dasgupta, Douglas R. McGregor
ICASSP
2008
IEEE
15 years 4 months ago
A new Particle Filtering algorithm with structurally optimal importance function
Bayesian estimation in nonlinear stochastic dynamical systems has been addressed for a long time. Among other solutions, Particle Filtering (PF) algorithms propagate in time a Mon...
Boujemaa Ait-El-Fquih, François Desbouvries
IBIS
2006
109views more  IBIS 2006»
14 years 9 months ago
Formulation Schema Matching Problem for Combinatorial Optimization Problem
: Schema matching is the task of finding semantic correspondences between elements of two schemas, which plays a key role in many database applications. In this paper, we cast the ...
Zhi Zhang, Pengfei Shi, Haoyang Che, Yong Sun, Jun...
COLT
2010
Springer
14 years 7 months ago
Optimal Algorithms for Online Convex Optimization with Multi-Point Bandit Feedback
Bandit convex optimization is a special case of online convex optimization with partial information. In this setting, a player attempts to minimize a sequence of adversarially gen...
Alekh Agarwal, Ofer Dekel, Lin Xiao