1948 search results - page 156 / 390 » Formalizing Mirror Theory |
279
click to vote
POPL
2007
ACM
16 years 6 months ago
2007
ACM
This paper contributes to the development of techniques for the modular proof of programs that include concurrent algorithms. We present a proof of a non-blocking concurrent algor...
182
click to vote
PODS
2007
ACM
16 years 6 months ago
2007
ACM
We show that relational algebra calculations for incomplete databases, probabilistic databases, bag semantics and whyprovenance are particular cases of the same general algorithms...
169
click to vote
TASE
2009
IEEE
16 years 1 months ago
2009
IEEE
Population protocols are an elegant model recently introduced for distributed algorithms running in large and unreliable networks of tiny mobile agents. Correctness proofs of such...
156
click to vote
ALDT
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We propose various models for lobbying in a probabilistic environment, in which an actor (called “The Lobby”) seeks to influence the voters’ preferences of voting ...
172
click to vote
ALDT
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. The stable marriage problem has many practical applications in twosided markets like those that assign doctors to hospitals, students to schools, or buyers to vendors. Mo...