Sciweavers

643 search results - page 58 / 129
» A browser for incremental programming
Sort
View
PLDI
1993
ACM
14 years 2 months ago
Real-Time Replication Garbage Collection
We have implemented the first copying garbage collector that permits continuous unimpeded mutator access to the original objects during copying. The garbage collector incremental...
Scott Nettles, James O'Toole
ESOP
2000
Springer
14 years 1 months ago
Improving the Representation of Infinite Trees to Deal with Sets of Trees
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...
Laurent Mauborgne
CORR
2008
Springer
86views Education» more  CORR 2008»
13 years 10 months ago
Twenty-Five Moves Suffice for Rubik's Cube
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...
Tomas Rokicki
ICALP
2007
Springer
14 years 4 months ago
Streaming and Fully Dynamic Centralized Algorithms for Constructing and Maintaining Sparse Spanners
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...
Michael Elkin
CEC
2005
IEEE
14 years 3 months ago
CasGP: building cascaded hierarchical models using niching
— A Cascaded model is introduced for mining large datasets using Genetic Programming without recourse to specialist hardware. Such an algorithm satisfies the seeming conflictin...
Peter Lichodzijewski, Malcolm I. Heywood, A. Nur Z...