Results 1  10
of
550,956
Evolutionary Speciation for Problem Decomposition
"... Modular problem decomposition is often employed to cope with complex realworld problems. An intelligent decomposition can efficiently lead to compact and general solutions but is, in most cases, the result of laborious domain analysis and engineering. Little has been done to automatically discover ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Modular problem decomposition is often employed to cope with complex realworld problems. An intelligent decomposition can efficiently lead to compact and general solutions but is, in most cases, the result of laborious domain analysis and engineering. Little has been done to automatically discover
Problem Decomposition for Reuse
, 1995
"... An approach to software development problems is presented, and illustrated by an example. The approach is based on the ideas of problem frames and structuring specifications by views. It is claimed that decompositions obtained by this approach result in a more effective separation of concerns, and t ..."
Abstract

Cited by 29 (6 self)
 Add to MetaCart
An approach to software development problems is presented, and illustrated by an example. The approach is based on the ideas of problem frames and structuring specifications by views. It is claimed that decompositions obtained by this approach result in a more effective separation of concerns
ATOMIC DECOMPOSITION BY BASIS PURSUIT
, 1995
"... The TimeFrequency and TimeScale communities have recently developed a large number of overcomplete waveform dictionaries  stationary wavelets, wavelet packets, cosine packets, chirplets, and warplets, to name a few. Decomposition into overcomplete systems is not unique, and several methods for d ..."
Abstract

Cited by 2731 (61 self)
 Add to MetaCart
the smallest l 1 norm of coefficients among all such decompositions. We give examples exhibiting several advantages over MOF, MP and BOB, including better sparsity, and superresolution. BP has interesting relations to ideas in areas as diverse as illposed problems, in abstract harmonic analysis, total
Uncertainty principles and ideal atomic decomposition
 IEEE Transactions on Information Theory
, 2001
"... Suppose a discretetime signal S(t), 0 t<N, is a superposition of atoms taken from a combined time/frequency dictionary made of spike sequences 1ft = g and sinusoids expf2 iwt=N) = p N. Can one recover, from knowledge of S alone, the precise collection of atoms going to make up S? Because every d ..."
Abstract

Cited by 588 (19 self)
 Add to MetaCart
/frequency dictionary, then there is only one such highly sparse representation of S, and it can be obtained by solving the convex optimization problem of minimizing the `1 norm of the coe cients among all decompositions. Here \highly sparse " means that Nt + Nw < p N=2 where Nt is the number of time atoms, Nw
Architecturedriven Problem Decomposition
 In Proceedings of the 12th IEEE International Requirements Engineering Conference (RE’04
, 2004
"... Jackson's Problem Frames provide a means of analysing and decomposing problems. They emphasise the world outside the computer helping the developer to focus on the problem domain instead of drifting into inventing solutions. The intention is to delay consideration of the solution space until a ..."
Abstract

Cited by 32 (14 self)
 Add to MetaCart
Jackson's Problem Frames provide a means of analysing and decomposing problems. They emphasise the world outside the computer helping the developer to focus on the problem domain instead of drifting into inventing solutions. The intention is to delay consideration of the solution space until a
A multilinear singular value decomposition
 SIAM J. Matrix Anal. Appl
, 2000
"... Abstract. We discuss a multilinear generalization of the singular value decomposition. There is a strong analogy between several properties of the matrix and the higherorder tensor decomposition; uniqueness, link with the matrix eigenvalue decomposition, firstorder perturbation effects, etc., are ..."
Abstract

Cited by 467 (20 self)
 Add to MetaCart
Abstract. We discuss a multilinear generalization of the singular value decomposition. There is a strong analogy between several properties of the matrix and the higherorder tensor decomposition; uniqueness, link with the matrix eigenvalue decomposition, firstorder perturbation effects, etc
Problem Decomposition in Configuration
, 2002
"... In the present work the issue of decomposing a configuration problem is approached in a framework where the domain knowledge is represented in a structured way by using a KLOne like language and wholepart relations play a major role in defining the structure of the configurable objects. The repres ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
. The computation of boundness among constraints is the basis for partitioning constraints associated with each component to be configured. Such a partitioning induces a decomposition of the configuration problem into independent subproblems. Both a recursive and a non recursive decomposition strategies
Problem Decomposition in Parallel Networks
, 1993
"... The improving computational speed of workstations makes clusters of these machines attractive for parallel computing. The workstation model of parallel processing, however, presents specific challenges caused by the latency of the communications network and the workload imbalance that arises from th ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
. These methods are analyzed in terms of problem size, number of processors, network speed, communication pattern, and bookkeeping requirements. Bounds are established for the performance of these decomposition schemes that can be used to make betterinformed data partitioning decisions. Keywords: Data
Dynamic Problem Decomposition in Configuration
, 2003
"... In this work, we show how the decomposition of a problem into a set of simpler and independent subproblems can be applied to automatic configuration. In particular, we ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
In this work, we show how the decomposition of a problem into a set of simpler and independent subproblems can be applied to automatic configuration. In particular, we
Global Optimization with Polynomials and the Problem of Moments
 SIAM Journal on Optimization
, 2001
"... We consider the problem of finding the unconstrained global minimum of a realvalued polynomial p(x) : R R, as well as the global minimum of p(x), in a compact set K defined by polynomial inequalities. It is shown that this problem reduces to solving an (often finite) sequence of convex linear mat ..."
Abstract

Cited by 569 (47 self)
 Add to MetaCart
We consider the problem of finding the unconstrained global minimum of a realvalued polynomial p(x) : R R, as well as the global minimum of p(x), in a compact set K defined by polynomial inequalities. It is shown that this problem reduces to solving an (often finite) sequence of convex linear
Results 1  10
of
550,956