Sciweavers

102 search results - page 18 / 21
» Semantically Restricted Argument Dependencies
Sort
View
FOIS
2006
13 years 8 months ago
Simultaneous Events and the "Once-Only" Effect
Abstract. Some events recur, and some happen only once. Galton refers to the latter as "once-only" events [1]. In a first-order logic of events that makes a type-token di...
Haythem O. Ismail
ICFP
2005
ACM
14 years 7 months ago
Modular verification of concurrent assembly code with dynamic thread creation and termination
Proof-carrying code (PCC) is a general framework that can, in principle, verify safety properties of arbitrary machine-language programs. Existing PCC systems and typed assembly l...
Xinyu Feng, Zhong Shao
TIT
1998
96views more  TIT 1998»
13 years 7 months ago
Sequential Prediction of Individual Sequences Under General Loss Functions
Abstract— We consider adaptive sequential prediction of arbitrary binary sequences when the performance is evaluated using a general loss function. The goal is to predict on each...
David Haussler, Jyrki Kivinen, Manfred K. Warmuth
DAARC
2007
Springer
137views Algorithms» more  DAARC 2007»
14 years 1 months ago
Anaphora Resolution as Equality by Default
The resolution of anaphora is dependent on a number of factors discussed in the literature: syntactic parallelism, topicality, etc. A system that attempts to resolve anaphora will ...
Ariel Cohen
DSN
2002
IEEE
14 years 13 days ago
Generic Timing Fault Tolerance using a Timely Computing Base
Designing applications with timeliness requirements in environments of uncertain synchrony is known to be a difficult problem. In this paper, we follow the perspective of timing ...
Antonio Casimiro, Paulo Veríssimo