Sciweavers

1576 search results - page 253 / 316
» Properties of Synthetic Optimization Problems
Sort
View
IH
1999
Springer
14 years 2 months ago
A Stochastic Approach to Content Adaptive Digital Image Watermarking
This paper presents a new stochastic approach which can be applied with di erent watermark techniques. The approach is based on the computation of a Noise Visibility Function NVF...
Sviatoslav Voloshynovskiy, Alexander Herrigel, Naz...
EUROGP
2007
Springer
126views Optimization» more  EUROGP 2007»
14 years 1 months ago
Training Binary GP Classifiers Efficiently: A Pareto-coevolutionary Approach
The conversion and extension of the Incremental Pareto-Coevolution Archive algorithm (IPCA) into the domain of Genetic Programming classification is presented. In particular, the ...
Michal Lemczyk, Malcolm I. Heywood
IJCAI
2003
13 years 11 months ago
Taming Decentralized POMDPs: Towards Efficient Policy Computation for Multiagent Settings
The problem of deriving joint policies for a group of agents that maximize some joint reward function can be modeled as a decentralized partially observable Markov decision proces...
Ranjit Nair, Milind Tambe, Makoto Yokoo, David V. ...
ML
2008
ACM
222views Machine Learning» more  ML 2008»
13 years 10 months ago
Boosted Bayesian network classifiers
The use of Bayesian networks for classification problems has received significant recent attention. Although computationally efficient, the standard maximum likelihood learning me...
Yushi Jing, Vladimir Pavlovic, James M. Rehg
AUTOMATICA
2005
108views more  AUTOMATICA 2005»
13 years 10 months ago
Enlarging the domain of attraction of MPC controllers
This paper presents a method for enlarging the domain of attraction of nonlinear model predictive control (MPC). The usual way of guaranteeing stability of nonlinear MPC is to add...
Daniel Limón, T. Alamo, Eduardo F. Camacho