1258 search results - page 16 / 252 » Architecture-driven Problem Decomposition |
114
click to vote
CEC
2005
IEEE
15 years 4 months ago
2005
IEEE
Abstract- Decomposing a complex computational problem into sub-problems, which are computationally simpler to solve individually and which can be combined to produce a solution to ...
104
click to vote
ICASSP
2011
IEEE
14 years 6 months ago
2011
IEEE
This paper presents a sparse approach of solving the onesided Procrustes problem with special orthogonal constraint. By leveraging a planar decomposition common to all rotation ma...
155
click to vote
JCT
2010
15 years 1 months ago
2010
Let m1, m2, . . . , mt be a list of integers. It is shown that there exists an integer N such that for all n ≥ N, the complete graph of order n can be decomposed into edge-disjo...
126
click to vote
GPEM
2008
15 years 2 months ago
2008
In this work a cooperative, bid-based, model for problem decomposition is proposed with application to discrete action domains such as classification. This represents a significan...
113
click to vote
MFPS
1991
15 years 6 months ago
1991
The problem of decomposing domains into sensible factors is addressed and solved for the case of dI-domains. A decomposition theorem is proved which allows the represention of a l...