894 search results - page 171 / 179 » Typed Contracts for Functional Programming |
ICALP
2003
Springer
14 years 1 months ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
SIGADA
1999
Springer
14 years 25 days ago
1999
Springer
In this paper we will demonstrate how Ada and its Distributed Annex may be used to relocate concurrent objects in a distributed data ow application. This relocation mechanism will...
ASPLOS
1996
ACM
14 years 22 days ago
1996
ACM
This paper describes Shasta, a system that supports a shared address space in software on clusters of computers with physically distributed memory. A unique aspect of Shasta compa...
LICS
1991
IEEE
14 years 2 days ago
1991
IEEE
We present an elementary axiomatisation of synthetic domain theory and show that it is sufficient to deduce the fixed point property and solve domain equations. Models of these a...
BMCBI
2010
13 years 8 months ago
2010
Background: Many bioinformatics analyses, ranging from gene clustering to phylogenetics, produce hierarchical trees as their main result. These are used to represent the relations...