1452 search results - page 197 / 291 » Algorithmic Analysis of Array-Accessing Programs |
101
click to vote
ASPLOS
2006
ACM
15 years 4 months ago
2006
ACM
This paper explores hierarchical instruction scheduling for a tiled processor. Our results show that at the top level of the hierarchy, a simple profile-driven algorithm effective...
102
Voted
CC
2004
Springer
15 years 6 months ago
2004
Springer
An important issue in embedded systems design is the size of programs. As computing devices decrease in size, yet with more and more functions, better code size optimizations are i...
ICDE
2008
IEEE
15 years 7 months ago
2008
IEEE
We formulate three intuitive semantic properties for topk queries in probabilistic databases, and propose GlobalTopk query semantics which satisfies all of them. We provide a dyn...
107
Voted
SAT
2004
Springer
15 years 6 months ago
2004
Springer
Modern algorithms for the SAT problem reveal an almost tractable behavior on “real-world” instances. This is frequently contributed to the fact that these instances possess an ...
101
Voted
VLSID
1994
IEEE
15 years 4 months ago
1994
IEEE
In this paper, we present a formal analysis of the constraints of the scheduling problem, and evaluate the structure of the scheduling polytope described by those constraints. Pol...