Sciweavers

229 search results - page 15 / 46
» How Efficient Can Memory Checking Be
Sort
View
LISP
2008
97views more  LISP 2008»
13 years 7 months ago
Efficient and flexible access control via Jones-optimal logic program specialisation
We describe the use of a flexible meta-interpreter for performing access control checks on deductive databases. The meta-program is implemented in Prolog and takes as input a datab...
Steve Barker, Michael Leuschel, Mauricio Varea
ECOOP
2006
Springer
13 years 9 months ago
Scoped Types and Aspects for Real-Time Java
Real-time systems are notoriously difficult to design and implement, and, as many real-time problems are safety-critical, their solutions must be reliable as well as efficient and ...
Chris Andreae, Yvonne Coady, Celina Gibbs, James N...
ECOOP
2008
Springer
13 years 9 months ago
Computing Stack Maps with Interfaces
Abstract. Lightweight bytecode verification uses stack maps to annotate Java bytecode programs with type information in order to reduce the verification to type checking. This pape...
Frédéric Besson, Thomas P. Jensen, T...
AE
2003
Springer
13 years 11 months ago
ParaDisEO-Based Design of Parallel and Distributed Evolutionary Algorithms
ParaDisEO is a framework dedicated to the design of parallel and distributed metaheuristics including local search methods and evolutionary algorithms. This paper focuses on the la...
Sébastien Cahon, Nordine Melab, El-Ghazali ...
ICAC
2008
IEEE
14 years 2 months ago
Tailoring Resources: The Energy Efficient Consolidation Strategy Goes Beyond Virtualization
Virtualization and consolidation are two complementary techniques widely adopted in a global strategy to reduce system management complexity. In this paper we show how two simple ...
Jordi Torres, David Carrera, Vicenç Beltran...