675 search results - page 105 / 135 » Using Fairness to Make Abstractions Work |
105
click to vote
TOPLAS
2008
15 years 1 months ago
2008
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...
122
click to vote
CSFW
2008
IEEE
15 years 8 months ago
2008
IEEE
Abstract. The focus of work on information flow security has primarily been on definitions of security in asynchronous systems models. This paper considers systems with scheduler...
122
click to vote
TCC
2009
Springer
16 years 2 months ago
2009
Springer
Proofs of Retrievability (PoR), introduced by Juels and Kaliski [JK07], allow the client to store a file F on an untrusted server, and later run an efficient audit protocol in whi...
113
click to vote
TEI
2010
ACM
15 years 7 months ago
2010
ACM
In the world of interactive art, very few pieces have a permanent, physical outcome. In response to this observation, the author developed two “cobots”, or collaborative robot...
ICRA
2008
IEEE
15 years 8 months ago
2008
IEEE
— In this paper, we lay the groundwork for extending our previously developed ASyMTRe architecture to enable constructivist learning for multi-robot team tasks. The ASyMTRe archi...