1686 search results - page 39 / 338 » Programs as polygraphs: computability and complexity |
133
click to vote
CCGRID
2008
IEEE
15 years 4 months ago
2008
IEEE
To be competitive, Enterprises are collecting and analyzing increasingly large amount of data in order to derive business insights. However, there are at least two challenges to m...
76
Voted
ESOP
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We describe a new technique for computing procedure summaries for performing an interprocedural analysis on programs. Procedure summaries are computed by performing a bac...
ICS
2009
Tsinghua U.
15 years 4 months ago
2009
Tsinghua U.
Power and energy are first-order design constraints in high performance computing. Current research using dynamic voltage scaling (DVS) relies on trading increased execution time...
SIGCSE
2002
ACM
14 years 9 months ago
2002
ACM
A number of communication libraries have been written to support concurrent programming. For a variety of reasons, these libraries generally are not well-suited for use in undergr...
AMAST
2006
Springer
15 years 1 months ago
2006
Springer
We propose two characterizations of complexity classes by means of programming languages. The first concerns Logspace while the second leads to Ptime. This latter characterization ...