9405 search results - page 221 / 1881 » Computing a Model of Set Theory |
154
click to vote
SPAA
1993
ACM
15 years 8 months ago
1993
ACM
In this paper we introduce the ConSet communication model for distributed memory parallel computers. The communication needs of an application program can be satisfied by some ar...
128
click to vote
COMGEO
1999
ACM
15 years 4 months ago
1999
ACM
This paper discusses algorithms for labeling sets of points in the plane, where labels are not restricted to some finite number of positions. We show that continuously sliding lab...
141
click to vote
COMPGEOM
2004
ACM
15 years 9 months ago
2004
ACM
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...
168
click to vote
ASP
2001
Springer
15 years 8 months ago
2001
Springer
Answer-set programming (ASP) solvers must handle difficult computational problems that are NP-hard. These solvers are in the worst case exponential and their scope of applicabilit...
126
click to vote
FOCS
2004
IEEE
15 years 8 months ago
2004
IEEE
A desirable goal for cryptographic protocols is to guarantee security when the protocol is composed with other protocol instances. Universally Composable (UC) protocols provide th...