945 search results - page 37 / 189 » Incremental Branching Programs |
POS
1998
Springer
13 years 12 months ago
1998
Springer
PMOS is an incremental garbage collector designed specifically to reclaim space in a persistent object store. It is complete in that it will, after a finite number of invocations,...
HASKELL
2009
ACM
14 years 2 months ago
2009
ACM
Structured documents are commonly edited using a free-form editor. Even though every string is an acceptable input, it makes sense to maintain a structured representation of the e...
PADL
2007
Springer
14 years 1 months ago
2007
Springer
Modern development environments integrate various static analyses into the build process. Analyses that analyze the whole project whenever the project changes are impractical in th...
CL
1999
Springer
13 years 7 months ago
1999
Springer
Van Emden's incremental queries address the inadequacy of current Prolog-style querying mechanism in most logic programming systems for interactive problem-solving. In the co...
COCO
2005
Springer
14 years 1 months ago
2005
Springer
It is well known that the hardest bit of integer multiplication is the middle bit, i.e. MULn−1,n. This paper contains several new results on its complexity. First, the size s of...