Sciweavers

232 search results - page 22 / 47
» Timed Commitments
Sort
View
STOC
2006
ACM
141views Algorithms» more  STOC 2006»
15 years 10 months ago
Zero-knowledge against quantum attacks
It is proved that several interactive proof systems are zero-knowledge against general quantum attacks. This includes the Goldreich?Micali?Wigderson classical zero-knowledge proto...
John Watrous
IROS
2008
IEEE
92views Robotics» more  IROS 2008»
15 years 4 months ago
Robotic assembly of complex planar parts: An experimental evaluation
Abstract— In this paper we present an experimental evaluation of automatic robotic assembly of complex planar parts. The torque-controlled DLR light-weight robot, equipped with a...
Paolo Robuffo Giordano, Andreas Stemmer, Klaus Arb...
ASPLOS
2006
ACM
15 years 3 months ago
Unbounded page-based transactional memory
Exploiting thread level parallelism is paramount in the multi-core era. Transactions enable programmers to expose such parallelism by greatly simplifying the multi-threaded progra...
Weihaw Chuang, Satish Narayanasamy, Ganesh Venkate...
CP
2005
Springer
15 years 3 months ago
Distributed Constraints for Large-Scale Scheduling Problems
Many problems of theoretical and practical interest can be formulated as Constraint Satisfaction Problems (CSPs). The general CSP is known to be NP-complete; however, distributed m...
Montserrat Abril, Miguel A. Salido, Federico Barbe...
DSOM
2004
Springer
15 years 3 months ago
A Formal Validation Model for the Netconf Protocol
Netconf is a protocol proposed by the IETF that defines a set of operations for network configuration. One of the main issues of Netconf is to define operations such as validate...
Sylvain Hallé, Rudy Deca, Omar Cherkaoui, R...