Sciweavers

9842 search results - page 112 / 1969
» Problem complexity
Sort
View
ICASSP
2008
IEEE
15 years 4 months ago
On quantifying the effects of noncircularity on the complex fastica algorithm
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...
Mike Novey, Tülay Adali
CEC
2005
IEEE
15 years 3 months ago
Complexity transitions in evolutionary algorithms: evaluating the impact of the initial population
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...
Anne Defaweux, Tom Lenaerts, Jano I. van Hemert, J...
ISMIS
2003
Springer
15 years 3 months ago
Searching for the Complex Decision Reducts: The Case Study of the Survival Analysis
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...
Jan G. Bazan, Andrzej Skowron, Dominik Slezak, Jak...
ICCAD
2000
IEEE
84views Hardware» more  ICCAD 2000»
15 years 2 months ago
Timing Driven Gate Duplication: Complexity Issues and Algorithms
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...
Ankur Srivastava, Ryan Kastner, Majid Sarrafzadeh
ECAI
2008
Springer
14 years 11 months ago
Single-peaked consistency and its complexity
Abstract. A common way of dealing with the paradoxes of preference aggregation consists in restricting the domain of admissible preferences. The most well-known such restriction is...
Bruno Escoffier, Jérôme Lang, Meltem ...