10916 search results - page 39 / 2184 » On Constructive Connectives and Systems |
ERLANG
2007
ACM
15 years 1 months ago
2007
ACM
With the increased use of network enabled applications and server hosted software systems, scalability with respect to network connectivity is becoming an increasingly important s...
SOFSEM
2009
Springer
15 years 6 months ago
2009
Springer
We prove NP-hardness of pure Nash equilibrium for some problems of scheduling games and connection games. The technique is standard: first, we construct a gadget without the desir...
TABLEAUX
1995
Springer
15 years 1 months ago
1995
Springer
We present a proof method for intuitionistic logic based on Wallen’s matrix characterization. Our approach combines the connection calculus and the sequent calculus. The search t...
CATS
2007
14 years 11 months ago
2007
We consider the problem of constructing a shortest Euclidean 2-connected Steiner network (SMN) for a set of terminals. This problem has natural applications in the design of survi...
102
click to vote
ENTCS
2008
14 years 10 months ago
2008
This paper initiates the study of sets in Euclidean space Rn (n 2) that are defined in terms of the dimensions of their elements. Specifically, given an interval I [0, 1], we ar...