1184 search results - page 170 / 237 » Memory Design for Constrained Dynamic Optimization Problems |
119
click to vote
VLSID
2009
IEEE
16 years 2 months ago
2009
IEEE
We propose a novel dependable SRAM with 7T cells and their array structure that avoids a half-selection problem. In addition, we introduce a new concept, "quality of a bit (Q...
123
click to vote
DATE
2003
IEEE
15 years 7 months ago
2003
IEEE
Novel reconfigurable computing architectures exploit the inherent parallelism available in many signalprocessing problems. These architectures often consist of networks of compute...
115
click to vote
SPAA
1997
ACM
15 years 6 months ago
1997
ACM
Consider a set of shared objects in a distributed network, where several copies of each object may exist at any given time. To ensure both fast access to the objects as well as e ...
117
click to vote
VLSID
2000
IEEE
15 years 6 months ago
2000
IEEE
The technique presented here achieves simultaneous optimization of schedule time and data path component cost within a structured data path architecture, using a genetic algorithm...
110
click to vote
GECCO
2004
Springer
15 years 7 months ago
2004
Springer
Application-specific, parameterized local search algorithms (PLSAs), in which optimization accuracy can be traded off with runtime, arise naturally in many optimization contexts....