Sciweavers

5900 search results - page 405 / 1180
» Dependable Systems
Sort
View
RTA
2004
Springer
16 years 3 days ago
TORPA: Termination of Rewriting Proved Automatically
Abstract. In this paper it is described how a combination of polynomial interpretations, recursive path order, RFC match-bounds, the dependency pair method and semantic labelling c...
Hans Zantema
HPCN
1995
Springer
15 years 10 months ago
Using optimistic execution techniques as a parallelisation tool for general purpose computing
Abstract. Optimistic execution techniques are widely used in the field of parallel discrete event simulation. In this paper we discuss the use of optimism as a technique for paral...
Adam Back, Stephen Turner
178
Voted
STOC
1995
ACM
108views Algorithms» more  STOC 1995»
15 years 10 months ago
A parallel repetition theorem
We show that a parallel repetition of any two-prover one-round proof system (MIP(2, 1)) decreases the probability of error at an exponential rate. No constructive bound was previou...
Ran Raz
DOCENG
2008
ACM
15 years 8 months ago
Constructing a know-how repository of advices and warnings from procedural texts
In this paper, we show how a domain dependent know-how textual database of advices and warnings can be constructed from procedural texts. We show how arguments of type warnings an...
Lionel Fontan, Patrick Saint-Dizier
ECIR
2007
Springer
15 years 8 months ago
Natural Language Processing for Usage Based Indexing of Web Resources
Abstract. The identification of reliable and interesting items on Internet becomes more and more difficult and time consuming. This paper is a position paper describing our intend...
Anne Boyer, Armelle Brun