4940 search results - page 613 / 988 » On the Complexity of Universal Programs |
180
click to vote
POPL
2010
ACM
16 years 1 months ago
2010
ACM
We propose a programming paradigm called compress-and-conquer (CC) that leads to optimal performance on multicore platforms. Given a multicore system of p cores and a problem of s...
172
click to vote
ISCA
2009
IEEE
16 years 1 months ago
2009
IEEE
Shared-memory multi-threaded programming is inherently more difficult than single-threaded programming. The main source of complexity is that, the threads of an application can in...
157
click to vote
C5
2008
IEEE
16 years 1 months ago
2008
IEEE
End-user scripting languages are relatively easy to learn, but have limited expressive power. Tile-based scripting systems are particularly accessible to beginners, but usually ar...
163
click to vote
IWMM
2007
Springer
16 years 26 days ago
2007
Springer
This article presents a heap space analysis for (sequential) Java bytecode. The analysis generates heap space cost relations which define at compile-time the heap consumption of ...
195
click to vote
PLDI
2005
ACM
16 years 9 days ago
2005
ACM
We introduce a language and system that supports definition and composition of complex run-time security policies for Java applications. Our policies are comprised of two sorts o...