2477 search results - page 139 / 496 » Parallelizing Functional Programs by Generalization |
112
click to vote
POPL
1998
ACM
15 years 6 months ago
1998
ACM
Memory expansions are classical means to extract parallelism from imperative programs. However, for dynamic control programs with general memory accesses, such transformations eit...
125
click to vote
KDD
2009
ACM
15 years 7 months ago
2009
ACM
Graphs or networks can be used to model complex systems. Detecting community structures from large network data is a classic and challenging task. In this paper, we propose a nove...
119
Voted
OOPSLA
2004
Springer
15 years 8 months ago
2004
Springer
We identify three design principles for reflection and metaprogramming facilities in object oriented programming languages. Encapsulation: meta-level facilities must encapsulate t...
115
Voted
CP
2006
Springer
15 years 6 months ago
2006
Springer
We consider probabilistic constrained linear programs with general distributions for the uncertain parameters. These problems generally involve non-convex feasible sets. We develo...
233
click to vote
POPL
2006
ACM
16 years 2 months ago
2006
ACM
We introduce a new notion of bisimulation for showing contextual equivalence of expressions in an untyped lambda-calculus with an explicit store, and in which all expressed values...