Sciweavers

1258 search results - page 89 / 252
» Architecture-driven Problem Decomposition
Sort
View
CEC
2009
IEEE
14 years 3 months ago
Performance assessment of DMOEA-DD with CEC 2009 MOEA competition test instances
—In this paper, the DMOEA-DD, which is an improvement of DMOEA[1, 2] by using domain decomposition technique, is applied to tackle the CEC 2009 MOEA competition test instances th...
Minzhong Liu, Xiufen Zou, Yu Chen, Zhijian Wu
ICASSP
2008
IEEE
14 years 3 months ago
A first step to convolutive sparse representation
In this paper an extension of the sparse decomposition problem is considered and an algorithm for solving it is presented. In this extension, it is known that one of the shifted v...
Hamed Firouzi, Massoud Babaie-Zadeh, Aria Ghasemia...
FOCS
1991
IEEE
14 years 20 days ago
Dynamic Three-Dimensional Linear Programming
We perform linear programming optimizations on the intersection of k polyhedra in R3 , represented by their outer recursive decompositions, in expected time O(k log k log n + √ ...
David Eppstein
PDCN
2004
13 years 10 months ago
Scalable parallel algorithms for difficult combinatorial problems: A case study in optimization
A novel combination of emergent algorithmic methods, powerful computational platforms and supporting infrastructure is described. These complementary tools and technologies are us...
Faisal N. Abu-Khzam, Michael A. Langston, Pushkar ...
SADM
2008
178views more  SADM 2008»
13 years 8 months ago
Fast Projection-Based Methods for the Least Squares Nonnegative Matrix Approximation Problem
: Nonnegative matrix approximation (NNMA) is a popular matrix decomposition technique that has proven to be useful across a diverse variety of fields with applications ranging from...
Dongmin Kim, Suvrit Sra, Inderjit S. Dhillon