Sciweavers

1184 search results - page 62 / 237
» Memory Design for Constrained Dynamic Optimization Problems
Sort
View
ASPLOS
1998
ACM
15 years 6 months ago
Segregating Heap Objects by Reference Behavior and Lifetime
Dynamic storage allocation has become increasingly important in many applications, in part due to the use of the object-oriented paradigm. At the same time, processor speeds are i...
Matthew L. Seidl, Benjamin G. Zorn
ASPDAC
2004
ACM
141views Hardware» more  ASPDAC 2004»
15 years 7 months ago
An approach for reducing dynamic power consumption in synchronous sequential digital designs
— The problem of minimizing dynamic power consumption by scaling down the supply voltage of computational elements off critical paths is widely addressed in the literature for th...
Noureddine Chabini, Wayne Wolf
CIMCA
2005
IEEE
15 years 7 months ago
A Hybrid Estimation of Distribution Algorithm for the Minimal Switching Graph Problem
Minimal Switching Graph (MSG) is a graphical model for the constrained via minimization problem — a combinatorial optimization problem in integrated circuit design automation. F...
Maolin Tang, Raymond Y. K. Lau
IPPS
2006
IEEE
15 years 8 months ago
Automatic application-specific microarchitecture reconfiguration
Applications for constrained embedded systems are subject to strict time constraints and restrictive resource utilization. With soft core processors, application developers can cu...
Shobana Padmanabhan, Ron K. Cytron, Roger D. Chamb...
IJCAI
2007
15 years 3 months ago
Automated Design of Multistage Mechanisms
Mechanism design is the study of preference aggregation protocols that work well in the face of self-interested agents. We present the first general-purpose techniques for automa...
Tuomas Sandholm, Vincent Conitzer, Craig Boutilier