Sciweavers

506 search results - page 52 / 102
» A case for an SC-preserving compiler
Sort
View
IWMM
2007
Springer
122views Hardware» more  IWMM 2007»
14 years 1 months ago
Overlooking roots: a framework for making nondeferred reference-counting garbage collection fast
Numerous optimizations exist for improving the performance of nondeferred reference-counting (RC) garbage collection. Their designs are ad hoc, intended to exploit different count...
Pramod G. Joisha
ESA
1997
Springer
93views Algorithms» more  ESA 1997»
13 years 12 months ago
Quasi-Fully Dynamic Algorithms for Two-Connectivity, Cycle Equivalence and Related Problems
In thispaper we introduce a new class of dynamicgraphalgorithmscalledquasi-fully dynamic algorithms,which are much more general than the backtracking algorithmsand are much simple...
Madhukar R. Korupolu, Vijaya Ramachandran
ICCBR
1995
Springer
13 years 11 months ago
On the use of CBR in optimisation problems such as the TSP
The particular strength of CBR is normally considered to be its use in weak theory domains where solution quality is compiled into cases and is reusable. In this paper we explore a...
Padraig Cunningham, Barry Smyth, Neil J. Hurley
WOTUG
2008
13 years 9 months ago
Experiments in Translating CSP || B to Handel-C
Abstract. This paper considers the issues involved in translating specifications described in the CSP B formal method into Handel-C. There have previously been approaches to transl...
Steve Schneider, Helen Treharne, Alistair McEwan, ...
ASPLOS
2010
ACM
14 years 2 months ago
MacroSS: macro-SIMDization of streaming applications
SIMD (Single Instruction, Multiple Data) engines are an essential part of the processors in various computing markets, from servers to the embedded domain. Although SIMD-enabled a...
Amir Hormati, Yoonseo Choi, Mark Woh, Manjunath Ku...