Sciweavers

2343 search results - page 114 / 469
» Structure and Interpretation of Computer Programs
Sort
View
ICALP
2004
Springer
15 years 10 months ago
Greedy Regular Expression Matching
This paper studies the problem of matching sequences against regular expressions in order to produce structured values.
Alain Frisch, Luca Cardelli
ISPAN
1996
IEEE
15 years 9 months ago
Design and evaluation of an environment APE for automatic parallelization of programs
In this paper, we have presented the design and evaluation of a compiler system, called APE,for automatic parallelization of scientific and engineering applications on distributed...
Vipin Chaudhary, Cheng-Zhong Xu, Sumit Roy, Jialin...
POPL
2008
ACM
16 years 5 months ago
Lightweight semiformal time complexity analysis for purely functional data structures
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...
Nils Anders Danielsson
PLDI
2010
ACM
15 years 10 months ago
Supporting speculative parallelization in the presence of dynamic data structures
The availability of multicore processors has led to significant interest in compiler techniques for speculative parallelization of sequential programs. Isolation of speculative s...
Chen Tian, Min Feng, Rajiv Gupta
AAAI
2012
13 years 7 months ago
Planning in Factored Action Spaces with Symbolic Dynamic Programming
We consider symbolic dynamic programming (SDP) for solving Markov Decision Processes (MDP) with factored state and action spaces, where both states and actions are described by se...
Aswin Raghavan, Saket Joshi, Alan Fern, Prasad Tad...