Sciweavers

4248 search results - page 210 / 850
» Simulating hci for all
Sort
View
CSL
2007
Springer
16 years 1 months ago
Unbounded Proof-Length Speed-Up in Deduction Modulo
In 1973, Parikh proved a speed-up theorem conjectured by G¨odel 37 years before: there exist arithmetical formulæ that are provable in first order arithmetic, but whose shorter ...
Guillaume Burel
TCC
2007
Springer
91views Cryptology» more  TCC 2007»
16 years 1 months ago
Lower Bounds for Non-interactive Zero-Knowledge
Abstract. We establish new lower bounds and impossibility results for noninteractive zero-knowledge proofs and arguments with set-up assumptions. – For the common random string m...
Hoeteck Wee
ICNP
2006
IEEE
16 years 1 months ago
Benefit-based Data Caching in Ad Hoc Networks
—Data caching can significantly improve the efficiency of information access in a wireless ad hoc network by reducing the access latency and bandwidth usage. However, designing e...
Bin Tang, Himanshu Gupta, Samir R. Das
MSWIM
2005
ACM
16 years 23 days ago
Application of synchronous dynamic encryption system in mobile wireless domains
Motivated by the tradeoff between security and efficiency performance parameters that has been imposed on all modern wireless security protocols, we designed a novel security syst...
Hamdy S. Soliman, Mohammed Omari
MABS
2004
Springer
16 years 17 days ago
Extending Time Management Support for Multi-agent Systems
Time management is essential when simulating multi-agent systems (MASs) as it allows consistent and repeatable simulation runs. So far, time management lacks support to express the...
Alexander Helleboogh, Tom Holvoet, Danny Weyns, Yo...