Sciweavers

2479 search results - page 256 / 496
» Quantum complexity theory
Sort
View
CORR
2010
Springer
140views Education» more  CORR 2010»
15 years 6 months ago
Refinement Types for Logical Frameworks and Their Interpretation as Proof Irrelevance
Refinement types sharpen systems of simple and dependent types by offering expressive means to more precisely classify well-typed terms. We present a system of refinement types for...
William Lovas, Frank Pfenning
CORR
2008
Springer
89views Education» more  CORR 2008»
15 years 6 months ago
Idiotypic Immune Networks in Mobile Robot Control
Jerne's idiotypic-network theory postulates that the immune response involves interantibody stimulation and suppression, as well as matching to antigens. The theory has proved...
Amanda M. Whitbrook, Uwe Aickelin, Jonathan M. Gar...
DEDS
2008
108views more  DEDS 2008»
15 years 6 months ago
An Algorithmic Toolbox for Network Calculus
Network calculus offers powerful tools to analyze the performances in communication networks, in particular to obtain deterministic bounds. This theory is based on a strong mathema...
Anne Bouillard, Eric Thierry
CORR
2006
Springer
87views Education» more  CORR 2006»
15 years 6 months ago
Pseudorandomness and Combinatorial Constructions
Abstract. In combinatorics, the probabilistic method is a very powerful tool to prove the existence of combinatorial objects with interesting and useful properties. Explicit constr...
Luca Trevisan
ENTCS
2006
113views more  ENTCS 2006»
15 years 6 months ago
Mining Propositional Simplification Proofs for Small Validating Clauses
The problem of obtaining small conflict clauses in SMT systems has received a great deal of attention recently. We report work in progress to find small subsets of the current par...
Ian Wehrman, Aaron Stump