-
-
...any positive integer c the problem whether the edge-set of a graph can be partitioned into subsets inducing graphs isomorphic to either a c-edge star or a c-edge matching is polynomial. this result suggests existence of theorems well-characterizing graphs admitting...
-
...requires tools and techniques for system decomposition and integration. a design structure matrix (dsm) provides a simple, compact, and visual representation of a complex system that supports innovative solutions to decomposition and integration problems. the advantages of dsms vis-a-vis alternative system representation and analysis techniques have...
-
...anh-uniform hypergraph generated by a set of edges {e
1,...,e
c} is said to be a delta-system δ(p,h,c) if...that forn≥n
0 the set of edges of a completeh-uniform hypergraphk
n
h can be partitioned into subsets generating isomorphic delta-systems δ(p, h, c) if...
-
...this paper presents a new rule-based tabu search technique for power system decomposition. in this paper, power system decomposition is considered to deal with...search method to solve the problem efficiently. different rules of power system decomposition are introduced into ts to reduce the solution neighborhood. the effectiveness of the proposed method is demonstrated...
-
...foregoing paper, dealing with the decomposition problem or a binary fuzzy relation defined in the cartesian product of a finite space. we characterize the whole set of the solutions of the max-min fuzzy relation...
-
...are equally separated in terms of the number of nodes and control variables. system decomposition is one of difficult discrete number combinatorial problems. the psa technique provides better solutions than the conventional sa because of searching a solution near a global minimum over a wide range. the proposed method...
-
...all unknown. we call this problem "triple decomposition problem". this seems to be a harder problem because it requires quadratic systems to be solved instead of...two dierent protocols. the underlying problems in the two protocols dier slightly. we discuss the system and the underlying problems in one of the protocols in detail over...
-
...analysis for solving symmetric schur decomposition problems. a series of dy- namical systems are proposed for finding the orthogonal decomposition matrix x for a given symmetric matrixa which are...never escape from feasible region of an optimization problem when starting at it. by constructing a well-defined energy function corresponding to a dynamical system, it is shown that the...
-
...are equally separated in terms of the number of nodes and control variables. system decomposition is one of difficult discrete number combinatorial problems. the psa technique provides better solutions than the conventional sa because of searching a solution near a global minimum over a wide range. the proposed method...