1184 search results - page 24 / 237 » Memory Design for Constrained Dynamic Optimization Problems |
129
click to vote
AUSAI
2005
Springer
15 years 10 months ago
2005
Springer
This paper addresses the problem of scheduling jobs in soft real-time systems, where the utility of completing each job decreases over time. We present a utility-based framework fo...
120
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Abstract--A delay-constrained scheduling problem for pointto-point communication is considered: a packet of B bits must be transmitted by a hard deadline of T slots over a timevary...
157
click to vote
EVOW
2009
Springer
15 years 9 months ago
2009
Springer
This paper deals with the generation of balanced incomplete block designs (BIBD), a hard constrained combinatorial problem with multiple applications. This problem is here formulat...
135
click to vote
ISCA
2009
IEEE
15 years 11 months ago
2009
IEEE
Analysis of technology and application trends reveals a growing imbalance in the peak compute-to-memory-capacity ratio for future servers. At the same time, the fraction contribut...
122
click to vote
EMSOFT
2007
Springer
15 years 10 months ago
2007
Springer
Software components are modular and can enable post-deployment update, but their high overhead in runtime and memory is prohibitive for many embedded systems. This paper proposes ...