9842 search results - page 246 / 1969 » The Complexity of the Matching-Cut Problem |
VLSID
2007
IEEE
16 years 28 days ago
2007
IEEE
? We give a new recursive rounding linear programming (LP) solution to the problem of N-detect test minimzation. This is a polynomialtime solution that closely approximates the exa...
119
click to vote
ICASSP
2008
IEEE
15 years 7 months ago
2008
IEEE
The complex fast independent component analysis (c-FastICA) algorithm is one of the most popular methods for solving the ICA problem with complex-valued data. In this study, we ex...
104
Voted
CEC
2005
IEEE
15 years 6 months ago
2005
IEEE
Abstract- This paper proposes an evolutionary approach for the composition of solutions in an incremental way. The approach is based on the metaphor of transitions in complexity di...
76
Voted
ISMIS
2003
Springer
15 years 5 months ago
2003
Springer
Generalization of the fundamental rough set discernibility tools aiming at searching for relevant patterns for complex decisions is discussed. As an example of application, there i...
88
Voted
ICCAD
2000
IEEE
15 years 5 months ago
2000
IEEE
This paper addresses the issue of timing driven gate duplication for delay optimization. Gate duplication has been used extensively for cutset minimization but the usefulness in m...