Sciweavers

159 search results - page 1 / 32
» Solving NP-Complete Problems With Networks of Evolutionary P...
Sort
View
IWANN
2001
Springer
13 years 9 months ago
Solving NP-Complete Problems With Networks of Evolutionary Processors
We propose a computational device based on evolutionary rules and communication within a network, similar to that introduced in [4], called network of evolutionary processors. An ...
Juan Castellanos, Carlos Martín-Vide, Victo...
GLOBECOM
2008
IEEE
13 years 11 months ago
Impact of Constraints on the Complexity of Dynamic Spectrum Assignment
— In this paper we study the complexity of spectrum assignment problems in cognitive radio networks (CRNs) in the presence of several constraints. Although optimal spectrum assig...
Chetan Nanjunda Mathur, Mohamed A. Haleem, Rajarat...
CGO
2003
IEEE
13 years 10 months ago
Addressing Mode Selection
Many processor architectures provide a set of addressing modes in their address generation units. For example DSPs (digital signal processors) have powerful addressing modes for e...
Erik Eckstein, Bernhard Scholz
IPPS
2010
IEEE
13 years 2 months ago
Broadcasting on large scale heterogeneous platforms under the bounded multi-port model
We consider the problem of broadcasting a large message in a large scale distributed platform. The message must be sent from a source node, with the help of the receiving peers whi...
Olivier Beaumont, Lionel Eyraud-Dubois, Shailesh K...
VECPAR
1998
Springer
13 years 9 months ago
Solving Eigenvalue Problems on Networks of Processors
Domingo Giménez, C. Jiménez, M. J. M...