9405 search results - page 250 / 1881 » Computing a Model of Set Theory |
140
click to vote
CCGRID
2008
IEEE
15 years 11 months ago
2008
IEEE
Collective operations and non-blocking point-to-point operations are two important parts of MPI that each provide important performance and programmability benefits. Although non...
151
click to vote
TACAS
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. We present a method which computes optimized representations for non-convex polyhedra. Our method detects so-called redundant linear constraints in these representations ...
145
click to vote
PODC
1999
ACM
15 years 8 months ago
1999
ACM
ÐIn this paper, we investigate the k-set consensus problem in asynchronous distributed systems. In this problem, each participating process begins the protocol with an input value...
129
click to vote
CONCUR
1991
Springer
15 years 8 months ago
1991
Springer
This paper deals with verification methods based on equivalence relations between labeled transition systems. More precisely, we are concerned by two practical needs: how to effi...
127
click to vote
CSR
2009
Springer
15 years 7 months ago
2009
Springer
In this paper we investigate the following two questions: Q1: Do there exist optimal proof systems for a given language L? Q2: Do there exist complete problems for a given promise ...