Sciweavers

1352 search results - page 16 / 271
» An algorithm for minimizing the Mumford-Shah functional
Sort
View
DAM
2011
13 years 3 months ago
On minimal Sturmian partial words
Partial words, which are sequences that may have some undefined positions called holes, can be viewed as sequences over an extended alphabet A = A ∪ { }, where stands for a hol...
Francine Blanchet-Sadri, John Lensmire
ICASSP
2011
IEEE
13 years 10 days ago
SRF: Matrix completion based on smoothed rank function
In this paper, we address the matrix completion problem and propose a novel algorithm based on a smoothed rank function (SRF) approximation. Among available algorithms like FPCA a...
Hooshang Ghasemi, Mohmmadreza Malek-Mohammadi, Mas...
MST
2008
157views more  MST 2008»
13 years 8 months ago
Optimal On-Line Algorithms to Minimize Makespan on Two Machines with Resource Augmentation
We study the problem of on-line scheduling on two uniformly related machines where the on-line algorithm has resources different from those of the off-line algorithm. We consider ...
Leah Epstein, Arik Ganot
CCE
2011
13 years 3 months ago
Optimization-based design of reactive distillation columns using a memetic algorithm
This contribution deals with the optimization of the design of reactive distillation columns by using a memetic algorithm (MA) which is a combination of an evolution strategy (ES)...
Maren Urselmann, S. Barkmann, Guido Sand, Sebastia...
INFORMATICALT
2006
117views more  INFORMATICALT 2006»
13 years 8 months ago
Job Sequencing with Exponential Functions of Processing Times
We study single machine scheduling problems, where processing times of the jobs are exponential functions of their start times. For increasing functions, we prove strong NP-hardnes...
Adam Janiak, Mikhail Y. Kovalyov