Sciweavers

10608 search results - page 665 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
224
Voted
GECCO
2005
Springer
107views Optimization» more  GECCO 2005»
16 years 24 days ago
Minimum spanning trees made easier via multi-objective optimization
Many real-world problems are multi-objective optimization problems and evolutionary algorithms are quite successful on such problems. Since the task is to compute or approximate t...
Frank Neumann, Ingo Wegener
GECCO
2005
Springer
143views Optimization» more  GECCO 2005»
16 years 24 days ago
Niching in evolution strategies
Evolutionary Algorithms (EAs), popular search methods for solving search and optimization problems, are known for successful and fast location of single optimal solutions. However,...
Ofer M. Shir, Thomas Bäck
ISNN
2005
Springer
16 years 23 days ago
A Block-Adaptive Subspace Method Using Oblique Projections for Blind Separation of Convolutive Mixtures
This paper presents a block-adaptive subspace algorithm via oblique projection for blind source separation (BSS) problem of convolutive mixtures. In the proposed algorithm, the pro...
Chunyi Peng, Xianda Zhang, Qutang Cai
CSCLP
2005
Springer
16 years 22 days ago
Among, Common and Disjoint Constraints
Abstract. Among, Common and Disjoint are global constraints useful in modelling problems involving resources. We study a number of variations of these constraints over integer and ...
Christian Bessière, Emmanuel Hebrard, Brahi...
162
Voted
DATE
2003
IEEE
101views Hardware» more  DATE 2003»
16 years 17 days ago
Exploiting the Routing Flexibility for Energy/Performance Aware Mapping of Regular NoC Architectures
In this paper, we present an algorithm which automatically maps the IPs onto a generic regular Network on Chip (NoC) architecture and constructs a deadlock-free deterministic rout...
Jingcao Hu, Radu Marculescu