Sciweavers

4432 search results - page 191 / 887
» Solving Demodulation as an Optimization Problem
Sort
View
141
Voted
PPOPP
2005
ACM
15 years 9 months ago
A linear-time algorithm for optimal barrier placement
We want to perform compile-time analysis of an SPMD program and place barriers in it to synchronize it correctly, minimizing the runtime cost of the synchronization. This is the b...
Alain Darte, Robert Schreiber
106
Voted
JPDC
2006
133views more  JPDC 2006»
15 years 3 months ago
Grid computing for parallel bioinspired algorithms
This paper focuses on solving large size combinatorial optimization problems using a Grid-enabled framework called ParadisEO
Nouredine Melab, Sébastien Cahon, El-Ghazal...
133
Voted
SIAMIS
2010
155views more  SIAMIS 2010»
14 years 10 months ago
Smoothing Nonlinear Conjugate Gradient Method for Image Restoration Using Nonsmooth Nonconvex Minimization
Image restoration problems are often converted into large-scale, nonsmooth and nonconvex optimization problems. Most existing minimization methods are not efficient for solving su...
Xiaojun Chen, Weijun Zhou
121
Voted
JSAC
2007
109views more  JSAC 2007»
15 years 3 months ago
Optimization of Semi-Dynamic Lightpath Rearrangements in a WDM Network
— In this paper, we study the Routing and Wavelength Assignment (RWA) problem in a semi-dynamic scenario where rearrangements are conducted in a series of sessions after traffic...
Yiming Zhang, Oliver W. W. Yang, Jing Wu, Michel S...
138
Voted
CEC
2007
IEEE
15 years 5 months ago
Hybrid optimization using DIRECT, GA, and SQP for global exploration
— As there are many good optimization algorithms each with its own characteristics, it is very difficult to choose the best method for optimization problems. Thus, it is importa...
Satoru Hiwa, Tomoyuki Hiroyasu, Mitsunori Miki