Sciweavers

1071 search results - page 199 / 215
» The Calculus of Algebraic Constructions
Sort
View
RSA
2006
74views more  RSA 2006»
13 years 9 months ago
Robust locally testable codes and products of codes
We continue the investigation of locally testable codes, i.e., error-correcting codes for whom membership of a given word in the code can be tested probabilistically by examining ...
Eli Ben-Sasson, Madhu Sudan
TSE
2008
97views more  TSE 2008»
13 years 9 months ago
Timed Automata Patterns
Timed Automata have proven to be useful for specification and verification of real-time systems. System design using Timed Automata relies on explicit manipulation of clock variabl...
Jin Song Dong, Ping Hao, Shengchao Qin, Jun Sun 00...
COMBINATORICS
2004
102views more  COMBINATORICS 2004»
13 years 9 months ago
Satisfiability and Computing van der Waerden Numbers
In this paper we bring together the areas of combinatorics and propositional satisfiability. Many combinatorial theorems establish, often constructively, the existence of positive...
Michael R. Dransfield, Lengning Liu, Victor W. Mar...
CORR
2004
Springer
100views Education» more  CORR 2004»
13 years 9 months ago
On the Theory of Structural Subtyping
We show that the first-order theory of structural subtyping of non-recursive types is decidable. Let be a language consisting of function symbols (representing type constructors)...
Viktor Kuncak, Martin C. Rinard
COGSCI
2002
60views more  COGSCI 2002»
13 years 9 months ago
Memory for goals: an activation-based model
Goal-directed cognition is often discussed in terms of specialized memory structures like the "goal stack." The goal-activation model presented here analyzes goal-direct...
Erik M. Altmann, J. Gregory Trafton