Sciweavers

537 search results - page 29 / 108
» Problems from CGCS Luminy, May 2007
Sort
View
ICMLA
2004
15 years 17 days ago
A new discrete binary particle swarm optimization based on learning automata
: The particle swarm is one of the most powerful methods for solving global optimization problems. This method is an adaptive algorithm based on social-psychological metaphor. A po...
Reza Rastegar, Mohammad Reza Meybodi, Kambiz Badie
FOCS
2007
IEEE
15 years 5 months ago
Mechanism Design via Differential Privacy
We study the role that privacy-preserving algorithms, which prevent the leakage of specific information about participants, can play in the design of mechanisms for strategic age...
Frank McSherry, Kunal Talwar
ICC
2007
IEEE
130views Communications» more  ICC 2007»
15 years 5 months ago
A Novel Key Redistribution Scheme for Wireless Sensor Networks
— Key management has long been a challenging problem in wireless Distributed Sensor Networks (DSNs) due to their high security requirements and strict resource constraints. Recen...
Chun-Fai Law, Ka-Shun Hung, Yu-Kwong Kwok
ISCC
2007
IEEE
15 years 5 months ago
Validating Attacks on Authentication Protocols
— It is possible to show that well-known attacks on authentication protocols are flawed. This is a problem, since good protocols may thus be dismissed rather than improved and p...
Anders Moen Hagalisletto
ATAL
2007
Springer
15 years 5 months ago
Exchanging reputation values among heterogeneous agent reputation models: an experience on ART testbed
In open MAS it is often a problem to achieve agents' interoperability. The heterogeneity of its components turns the establishment of interaction or cooperation among them in...
Anarosa Brandão, Laurent Vercouter, Sara J....