1002 search results - page 73 / 201 » Towards Graph Programs for Graph Algorithms |
120
Voted
SEFM
2008
IEEE
15 years 8 months ago
2008
IEEE
We present an approach to find upper bounds of heap space for Java Card applets. Our method first transforms an input bytecode stream into a control flow graph (CFG), and then ...
129
click to vote
ECOOP
1993
Springer
15 years 6 months ago
1993
Springer
Abstract. We have designed and implemented a type inference algorithm for the Self language. The algorithm can guarantee the safety and disambiguity of message sends, and provide u...
112
click to vote
ISLPED
2003
ACM
15 years 7 months ago
2003
ACM
This paper proposes two very fast graph theoretic heuristics for the low power binding problem given fixed number of resources and multiple architectures for the resources. First...
157
Voted
IPCO
2008
15 years 3 months ago
2008
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
133
click to vote
PPOPP
2005
ACM
15 years 8 months ago
2005
ACM
We want to perform compile-time analysis of an SPMD program and place barriers in it to synchronize it correctly, minimizing the runtime cost of the synchronization. This is the b...