2016 search results - page 364 / 404 » Megamaps: Construction and Examples |
STOC
1999
ACM
14 years 2 months ago
1999
ACM
We investigate the question of when a prover can aid a verifier to reliably compute a function faster than if the verifier were to compute the function on its own. Our focus is ...
ICRA
1999
IEEE
14 years 2 months ago
1999
IEEE
We consider the robot exploration of a planar graphlike world. The robot's goal is to build a complete map of its environment. The environment is modeled as an arbitrary undi...
ARTS
1999
Springer
14 years 2 months ago
1999
Springer
Model checking can tell us whether a system is correct; probabilistic model checking can also tell us whether a system is timely and reliable. Moreover, probabilistic model checkin...
TCC
2009
Springer
14 years 10 months ago
2009
Springer
Extractable functions are functions where any adversary that outputs a point in the range of the function is guaranteed to "know" a corresponding preimage. Here, knowledg...
POPL
2005
ACM
14 years 10 months ago
2005
ACM
We introduce transactors, a fault-tolerant programming model for composing loosely-coupled distributed components running in an unreliable environment such as the internet into sy...