Sciweavers

10666 search results - page 1566 / 2134
» Quantum programming languages
Sort
View
ICALP
1995
Springer
15 years 10 months ago
Weakly Useful Sequences
An infinite binary sequence x is defined to be (i) strongly useful if there is a computable time bound within which every decidable sequence is Turing reducible to x; and (ii) w...
Stephen A. Fenner, Jack H. Lutz, Elvira Mayordomo
ICALP
1991
Springer
15 years 10 months ago
On-Line Algorithms for Weighted Bipartite Matching and Stable Marriages
We give an on-line deterministic algorithm for the weighted bipartite matching problem that achieves a competitive ratio of (2n − 1) in any metric space (where n is the number o...
Samir Khuller, Stephen G. Mitchell, Vijay V. Vazir...
POPL
1991
ACM
15 years 10 months ago
Subtyping Recursive Types
We investigate the interactions of subtyping and recursive types, in a simply typed λ-calculus. The two fundamental questions here are whether two (recursive) types are in the su...
Roberto M. Amadio, Luca Cardelli
POPL
1991
ACM
15 years 10 months ago
Coordinating First-Order Multiparty Interactions
-order multiparty interaction is an abstraction mechanism that defines communication among a set of formal process roles. Actual processes participate in a first-order interactio...
Yuh-Jzer Joung, Scott A. Smolka
APLAS
2008
ACM
15 years 9 months ago
The Complexity of Coverage
Abstract. We study the problem of generating a test sequence that achieves maximal coverage for a reactive system under test. We formulate the problem as a repeated game between th...
Krishnendu Chatterjee, Luca de Alfaro, Rupak Majum...
« Prev « First page 1566 / 2134 Last » Next »