Sciweavers

3690 search results - page 36 / 738
» Computation with classical sequents
Sort
View
HIPC
2003
Springer
14 years 4 months ago
Delay and Jitter Minimization in High Performance Internet Computing
Delay and jitter management in high performance active computation is a challenging problem in the emerging area of internet computing. The problem takes a complex new form from it...
Javed I. Khan, Seung Su Yang
CORR
2008
Springer
107views Education» more  CORR 2008»
13 years 10 months ago
Metric Structures and Probabilistic Computation
Abstract. Continuous first-order logic is used to apply model-theoretic analysis to analytic structures (e.g. Hilbert spaces, Banach spaces, probability spaces, etc.). Classical co...
Wesley Calvert
CORR
2004
Springer
94views Education» more  CORR 2004»
13 years 10 months ago
Quantum Computing, Postselection, and Probabilistic Polynomial-Time
I study the class of problems efficiently solvable by a quantum computer, given the ability to "postselect" on the outcomes of measurements. I prove that this class coin...
Scott Aaronson
ANTS
2010
Springer
216views Algorithms» more  ANTS 2010»
14 years 2 months ago
Efficient Pairing Computation with Theta Functions
In this paper, we present a new approach based on theta functions to compute Weil and Tate pairings. A benefit of our method, which does not rely on the classical Miller's alg...
David Lubicz, Damien Robert
ICTAC
2009
Springer
14 years 5 months ago
The Secret Art of Computer Programming
“Classical” program development by refinement [12, 2, 3] is a technique for ensuring that source-level program code remains faithful to the semantic goals set out in its corre...
Annabelle McIver