Sciweavers

4432 search results - page 352 / 887
» Solving Demodulation as an Optimization Problem
Sort
View
EOR
2010
140views more  EOR 2010»
15 years 2 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
AAAI
2008
15 years 7 months ago
Resource Constrained Distributed Constraint Optimization with Virtual Variables
Cooperative problem solving with resource constraints are important in practical multi-agent systems. Resource constraints are necessary to handle practical problems including dis...
Toshihiro Matsui, Hiroshi Matsuo, Marius Silaghi, ...
ISBI
2009
IEEE
15 years 11 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
ICASSP
2009
IEEE
15 years 11 months ago
Map approach to learning sparse Gaussian Markov networks
Recently proposed l1-regularized maximum-likelihood optimization methods for learning sparse Markov networks result into convex problems that can be solved optimally and efficien...
Narges Bani Asadi, Irina Rish, Katya Scheinberg, D...
CEC
2007
IEEE
15 years 11 months ago
Performance tuning of genetic algorithms with reserve selection
Abstract— This paper provides a deep insight into the performance of genetic algorithms with reserve selection (GARS), and investigates how parameters can be regulated to solve o...
Yang Chen, Jinglu Hu, Kotaro Hirasawa, Songnian Yu