23 search results - page 2 / 5 » A Runtime Reconfigurable Implementation of the GSAT Algorith... |
GPEM
2002
13 years 5 months ago
2002
Ant Colony Optimization (ACO) is a metaheuristic used to solve combinatorial optimization problems. As with other metaheuristics, like evolutionary methods, ACO algorithms often sh...
FCCM
1997
IEEE
13 years 9 months ago
1997
IEEE
The Wormhole Run-Time Reconfiguration (RTR) computing paradigm is a method for creating high performance computational pipelines. The scalability, distributed control and data pow...
ISCAS
2003
IEEE
13 years 10 months ago
2003
IEEE
The Hamiltonian Cycle (HC) problem is an important graph problem with many applications. The general backtracking algorithm normally used for random graphs often takes far too lon...
CHES
2008
Springer
13 years 7 months ago
2008
Springer
Dynamically reconfigurable systems are known to have many advantages such as area and power reduction. The drawbacks of these systems are the reconfiguration delay and the overhead...
DFT
1999
IEEE
13 years 9 months ago
1999
IEEE
The inherent redundancy and in-the-field reconfiguration capabilities of field programmable gate arrays (FPGAs) provide alternatives to integrated circuit redundancy-based fault r...