Sciweavers

1020 search results - page 192 / 204
» Tight Semantics for Logic Programs
Sort
View
101
Voted
CONCUR
2007
Springer
15 years 8 months ago
Asynchronous Games: Innocence Without Alternation
The notion of innocent strategy was introduced by Hyland and Ong in order to capture the interactive behaviour of λ-terms and PCF programs. An innocent strategy is defined as an ...
Paul-André Melliès, Samuel Mimram
143
Voted
LCPC
2009
Springer
15 years 7 months ago
A Communication Framework for Fault-Tolerant Parallel Execution
PC grids represent massive computation capacity at a low cost, but are challenging to employ for parallel computing because of variable and unpredictable performance and availabili...
Nagarajan Kanna, Jaspal Subhlok, Edgar Gabriel, Es...
164
Voted
UAI
1997
15 years 4 months ago
Object-Oriented Bayesian Networks
Bayesian networks provide a modeling language and associated inference algorithm for stochastic domains. They have been successfully applied in a variety of medium-scale applicati...
Daphne Koller, Avi Pfeffer
CCS
2004
ACM
15 years 8 months ago
Verifying policy-based security for web services
WS-SecurityPolicy is a declarative configuration language for driving web services security mechanisms. We describe a formal sefor WS-SecurityPolicy, and propose a more abstract ...
Karthikeyan Bhargavan, Cédric Fournet, Andr...
115
Voted
ISMB
1997
15 years 4 months ago
SEALS: A System for Easy Analysis of Lots of Sequences
We present a system of programs designed to facilitate sequence analysis projects involving large amounts of data. SEALS (System for Easy Analysis of Lots of Sequences) is a logic...
D. Roland Walker, Eugene V. Koonin