Sciweavers

3352 search results - page 188 / 671
» Hierarchical Problem Solving and the Bayesian Optimization A...
Sort
View
ISBI
2009
IEEE
16 years 1 months ago
Fast Algorithms for Nonconvex Compressive Sensing: MRI Reconstruction from Very Few Data
Compressive sensing is the reconstruction of sparse images or signals from very few samples, by means of solving a tractable optimization problem. In the context of MRI, this can ...
Rick Chartrand
182
Voted
ICRA
2008
IEEE
150views Robotics» more  ICRA 2008»
16 years 26 days ago
A Bayesian approach to empirical local linearization for robotics
— Local linearizations are ubiquitous in the control of robotic systems. Analytical methods, if available, can be used to obtain the linearization, but in complex robotics system...
Jo-Anne Ting, Aaron D'Souza, Sethu Vijayakumar, St...
EOR
2010
140views more  EOR 2010»
15 years 3 months ago
Cutting plane algorithms for 0-1 programming based on cardinality cuts
: We present new valid inequalities for 0-1 programming problems that work in similar ways to well known cover inequalities. Discussion and analysis of these cuts is followed by th...
Osman Oguz
CEC
2009
IEEE
16 years 1 months ago
Comparing parameter tuning methods for evolutionary algorithms
Abstract— Tuning the parameters of an evolutionary algorithm (EA) to a given problem at hand is essential for good algorithm performance. Optimizing parameter values is, however,...
Selmar K. Smit, A. E. Eiben
GECCO
2006
Springer
164views Optimization» more  GECCO 2006»
15 years 10 months ago
Adaptation for parallel memetic algorithm based on population entropy
In this paper, we propose the island model parallel memetic algorithm with diversity-based dynamic adaptive strategy (PMADLS) for controlling the local search frequency and demons...
Jing Tang, Meng-Hiot Lim, Yew-Soon Ong