Sciweavers

811 search results - page 56 / 163
» Refactoring Using Type Constraints
Sort
View
DKE
2006
138views more  DKE 2006»
13 years 8 months ago
Using the uni-level description (ULD) to support data-model interoperability
We describe a framework called the Uni-Level Description (ULD) for accurately representing information from a broad range of data models. The ULD extends previous metadata-model a...
Shawn Bowers, Lois M. L. Delcambre
SAFECOMP
2004
Springer
14 years 2 months ago
Using Fuzzy Self-Organising Maps for Safety Critical Systems
This paper defines a type of constrained artificial neural network (ANN) that enables analytical certification arguments whilst retaining valuable performance characteristics. ...
Zeshan Kurd, Tim Kelly
PC
2012
223views Management» more  PC 2012»
12 years 4 months ago
Using shared arrays in message-driven parallel programs
This paper describes a safe and efficient combination of the object-based message-driven execution and shared array parallel programming models. In particular, we demonstrate how ...
Phil Miller, Aaron Becker, Laxmikant V. Kalé...
OOPSLA
2005
Springer
14 years 2 months ago
Javari: adding reference immutability to Java
This paper describes a type system that is capable of expressing and enforcing immutability constraints. The speonstraint expressed is that the abstract state of the object to whi...
Matthew S. Tschantz, Michael D. Ernst
AI
2005
Springer
13 years 8 months ago
The distributed breakout algorithms
We present a new series of distributed constraint satisfaction algorithms, the distributed breakout algorithms, which is inspired by local search algorithms for solving the constr...
Katsutoshi Hirayama, Makoto Yokoo