Sciweavers

1717 search results - page 90 / 344
» A Computable Spectral Theorem
Sort
View
132
Voted
ICALP
2003
Springer
15 years 9 months ago
A Direct Sum Theorem in Communication Complexity via Message Compression
We prove lower bounds for the direct sum problem for two-party bounded error randomised multipleround communication protocols. Our proofs use the notion of information cost of a p...
Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
EVOW
2008
Springer
15 years 6 months ago
A Study of Some Implications of the No Free Lunch Theorem
We introduce the concept of "minimal" search algorithm for a set of functions to optimize. We investigate the structure of closed under permutation (c.u.p.) sets and we c...
Andrea Valsecchi, Leonardo Vanneschi
AI
2000
Springer
15 years 4 months ago
Proving theorems by reuse
We investigate the improvement of theorem proving by reusing previously computed proofs. We have developed and implemented the PLAGIATOR system which proves theorems by mathematic...
Christoph Walther, Thomas Kolbe
ISCI
2010
128views more  ISCI 2010»
15 years 2 months ago
Robust static output feedback controller synthesis using Kharitonov's theorem and evolutionary algorithms
This paper presents a simple but effective tuning strategy for robust static output feedback (SOF) controllers with minimal quadratic cost in the context of multiple parametric un...
Rosario Toscano, Patrick Lyonnet
APLAS
2006
ACM
15 years 10 months ago
Computational Secrecy by Typing for the Pi Calculus
We define and study a distributed cryptographic implementation for an asynchronous pi calculus. At the source level, we adapt simple type systems designed for establishing formal ...
Martín Abadi, Ricardo Corin, Cédric ...