Sciweavers

1941 search results - page 359 / 389
» On the Hardness of Approximate Reasoning
Sort
View
CCS
2006
ACM
15 years 3 months ago
Providing witness anonymity in peer-to-peer systems
In this paper, we introduce the concept of witness anonymity for peer-to-peer systems. Witness anonymity combines the seemingly conflicting requirements of anonymity (for honest p...
Bo Zhu, Sanjeev Setia, Sushil Jajodia
CLEF
2006
Springer
15 years 3 months ago
QolA: Fostering Collaboration Within QA
In this paper we suggest a QA pilot task, dubbed QolA, whose joint rationale is allow for collaboration among systems, increase multilinguality and multicollection use, and investi...
Diana Santos, Luís Costa
EMSOFT
2006
Springer
15 years 3 months ago
Analysis of the zeroconf protocol using UPPAAL
We report on a case study in which the model checker Uppaal is used to formally model parts of Zeroconf, a protocol for dynamic configuration of IPv4 link-local addresses that has...
Biniam Gebremichael, Frits W. Vaandrager, Miaomiao...
GECCO
2006
Springer
161views Optimization» more  GECCO 2006»
15 years 3 months ago
An empirical investigation of how and why neutrality affects evolutionary search
The effects of neutrality on evolutionary search have been considered in a number of interesting studies, the results of which, however, have been contradictory. Some researchers ...
Edgar Galván López, Riccardo Poli
ASIACRYPT
2003
Springer
15 years 3 months ago
Certificateless Public Key Cryptography
This paper introduces the concept of certificateless public key cryptography (CL-PKC). In contrast to traditional public key cryptographic systems, CL-PKC does not require the use...
Sattam S. Al-Riyami, Kenneth G. Paterson