144 search results - page 23 / 29 » Running time and program size for self-assembled squares |
LCTRTS
1999
Springer
13 years 11 months ago
1999
Springer
Code space is a critical issue facing designers of software for embedded systems. Many traditional compiler optimizations are designed to reduce the execution time of compiled cod...
SIGMETRICS
2009
ACM
14 years 1 months ago
2009
ACM
We consider the problem of admission control in resource sharing systems, such as web servers and transaction processing systems, when the job size distribution has high variabili...
TASE
2008
IEEE
13 years 7 months ago
2008
IEEE
Dynamic programming, branch-and-bound, and constraint programming are the standard solution principles for nding optimal solutions to machine scheduling problems. We propose a new ...
CVPR
2010
IEEE
14 years 3 months ago
2010
IEEE
This paper presents an algorithm for recovering the globally optimal 2D human figure detection using a loopy graph model. This is computationally challenging because the time comp...
HIPC
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. The theory of bulk-synchronous parallel computing has produced a large number of attractive algorithms, which are provably optimal in some sense, but typically require th...