Sciweavers

2621 search results - page 292 / 525
» Near orders and codes
Sort
View
PLILP
1994
Springer
15 years 10 months ago
Deriving Residual Reference Count Garbage Collectors
We present a strategy to derive an efficient reference count garbage collector for any applicative program by only modifying it on the source code level. The key to the approach is...
Wolfram Schulte
ITS
2010
Springer
149views Multimedia» more  ITS 2010»
15 years 8 months ago
How Adaptive Is an Expert Human Tutor?
In examine the tutoring protocols of one expert human tutor tutoring 10 students in solving physics problems, four analyses reveal that he tutored the five good learners in differe...
Michelene T. H. Chi, Marguerite Roy
DAGSTUHL
2007
15 years 8 months ago
Some Experiments on Tiling Loop Programs for Shared-Memory Multicore Architectures
The model-based transformation of loop programs is a way of detecting fine-grained parallelism in sequential programs. One of the challenges is to agglomerate the parallelism to a...
Armin Größlinger
OPODIS
2007
15 years 8 months ago
Making Distributed Applications Robust
We present a novel translation of systems that are tolerant of crash failures to systems that are tolerant of Byzantine failures in an asynchronous environment, making weaker assum...
Chi Ho, Danny Dolev, Robbert van Renesse
WSR
2008
15 years 8 months ago
Towards Querying of Traceability Information in the Context of Software Evolution
: Traceability of various artifacts created during the development of software systems plays an important role in software evolution. Subsequent changes to artifacts must be traced...
Hannes Schwarz, Jürgen Ebert, Volker Riediger...