1063 search results - page 205 / 213 » Order and Negation as Failure |
FPCA
1989
14 years 1 months ago
1989
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., v...
WDAG
1990
Springer
14 years 1 months ago
1990
Springer
A distributed task T is 1-solvable if there exists a protocol that solves it in the presence of (at most) one crash failure. A precise characterization of the 1-solvable tasks was...
ECOWS
2007
Springer
14 years 1 months ago
2007
Springer
Discovery of Web Services (WSs) has gained great research attention due to proliferation of available WSs and the failure of the syntactic approach of UDDI. Semantic discovery mech...
CCGRID
2004
IEEE
14 years 1 months ago
2004
IEEE
In this paper we investigate the utilization of nondedicated, opportunistic resources in a desktop environment to provide statistical assurances to a class of QoS sensitive, soft ...
AIIA
2003
Springer
14 years 1 months ago
2003
Springer
In this paper, we present GLARE, a domain-independent system for acquiring, representing and executing clinical guidelines. GLARE is characterized by the adoption of Artificial Int...