945 search results - page 96 / 189 » Incremental Branching Programs |
PLDI
1993
ACM
14 years 1 months ago
1993
ACM
We have implemented the first copying garbage collector that permits continuous unimpeded mutator access to the original objects during copying. The garbage collector incremental...
ESOP
2000
Springer
14 years 20 days ago
2000
Springer
In order to deal efficiently with infinite regular trees (or other pointed graph structures), we give new algorithms to store such structures. The trees are stored in such a way th...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
How many moves does it take to solve Rubik's Cube? Positions are known that require 20 moves, and it has already been shown that there are no positions that require 27 or mor...
AOSD
2008
ACM
13 years 11 months ago
2008
ACM
We propose test-based pointcuts, a novel pointcut mechanism for AspectJ-like aspect-oriented programming languages. The idea behind the test-based pointcuts is to specify join poi...
ICALP
2007
Springer
14 years 3 months ago
2007
Springer
We present a streaming algorithm for constructing sparse spanners and show that our algorithm out-performs significantly the state-of-the-art algorithm for this task [20]. Speci...