1730 search results - page 123 / 346 » Algebra and Computation |
107
click to vote
RELMICS
2005
Springer
15 years 9 months ago
2005
Springer
In this paper we present some examples of relational correspondences for not necessarily distributive lattices with modal-like operators of possibility (normal and additive operato...
148
click to vote
IFIPTCS
2010
15 years 1 months ago
2010
This paper describes some basic relationships between mathematical structures that are relevant in quantum logic and probability, namely convex sets, effect algebras, and a new cl...
134
Voted
IJCGA
2006
15 years 3 months ago
2006
We obtain lower bounds in the algebraic computation tree model for deciding the separability of two disjoint point sets. In particular, we show (n log n) time lower bounds for sep...
129
Voted
SACMAT
2009
ACM
15 years 10 months ago
2009
ACM
Collaborative and distributed applications, such as dynamic coalitions and virtualized grid computing, often require integrating access control policies of collaborating parties. ...
137
Voted
CSL
1992
Springer
15 years 7 months ago
1992
Springer
We develop the rst steps of a theory of concurrency within the framework of evolving algebras of Gurevich, with the aim of investigating its suitability for the role of a general f...