Sciweavers

1289 search results - page 168 / 258
» Complexity of Counting the Optimal Solutions
Sort
View
SPDP
1993
IEEE
15 years 2 months ago
Group Membership in a Synchronous Distributed System
This paper presents a solution to the (processor) group membership problem. The methodology followed in designing the algorithm is summarized by the option to optimize the perform...
Gianluigi Alari, Augusto Ciuffoletti
ARC
2007
Springer
140views Hardware» more  ARC 2007»
15 years 1 months ago
Reconfigurable Computing for Accelerating Protein Folding Simulations
Abstract. This paper presents a methodology for the design of a reconfigurable computing system applied to a complex problem in molecular Biology: the protein folding problem. An e...
Nilton B. Armstrong, Heitor S. Lopes, Carlos R. Er...
ASAP
2006
IEEE
108views Hardware» more  ASAP 2006»
15 years 1 months ago
New Schemes in Clustered VLIW Processors Applied to Turbo Decoding
State-of-the-art communication standards make extensive use of Turbo codes. The complex and power consuming designs that currently implement the turbo decoder expose the need for ...
Pablo Ituero, Marisa López-Vallejo
EWSA
2006
Springer
15 years 1 months ago
Automating the Building of Software Component Architectures
Assembling software components into an architecture is a difficult task because of its combinatorial complexity. There is thus a need for automating this building process, either t...
Nicolas Desnos, Sylvain Vauttier, Christelle Urtad...
AIPRF
2008
14 years 11 months ago
Internal vs. External Parameters in Fitness Functions
A fitness function is needed for a Genetic Algorithm (GA) to work, and it appears natural that the combination of objectives and constraints into a single scalar function using ar...
Pedro A. Diaz-Gomez, Dean F. Hougen