1017 search results - page 45 / 204 » Register computations on ordinals |
104
click to vote
LICS
2007
IEEE
15 years 6 months ago
2007
IEEE
d abstract) Marcin Jurdzi´nski and Ranko Lazi´c∗ Department of Computer Science, University of Warwick, UK An alternation-free modal µ-calculus over data trees is introduced ...
PODC
1990
ACM
15 years 3 months ago
1990
ACM
Emulators that translate algorithms from the shared-memory model to two different message-passing models are presented. Both are achieved by implementing a wait-free, atomic, singl...
FTDCS
2004
IEEE
15 years 3 months ago
2004
IEEE
Distributed denial of service (DDoS) is a major threat to the availability of Internet services. The anonymity allowed by IP networking, together with the distributed, large scale...
CONCUR
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. This paper presents SOAR: the first oblivious atomicity assertion with polynomial complexity. SOAR enables to check atomicity of a single-writer multi-reader register imp...
ECAI
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. In this article we present the framework of Possibilistic Influence Diagrams (PID), which allow to model in a compact form problems of sequential decision making under un...