Sciweavers

889 search results - page 171 / 178
» Observational Learning in Random Networks
Sort
View
CCR
2005
129views more  CCR 2005»
13 years 7 months ago
The problem of synthetically generating IP traffic matrices: initial recommendations
There exist a wide variety of network design problems that require a traffic matrix as input in order to carry out performance evaluation. The research community has not had at it...
Antonio Nucci, Ashwin Sridharan, Nina Taft
INFOCOM
2010
IEEE
13 years 6 months ago
Distributed Opportunistic Scheduling for Ad-Hoc Communications Under Delay Constraints
—With the convergence of multimedia applications and wireless communications, there is an urgent need for developing new scheduling algorithms to support real-time traffic with ...
Sheu-Sheu Tan, Dong Zheng, Junshan Zhang, James R....
WPES
2003
ACM
14 years 1 months ago
Reusable anonymous return channels
Mix networks are used to deliver messages anonymously to recipients, but do not straightforwardly allow the recipient of an anonymous message to reply to its sender. Yet the abili...
Philippe Golle, Markus Jakobsson
GECCO
2008
Springer
143views Optimization» more  GECCO 2008»
13 years 8 months ago
How social structure and institutional order co-evolve beyond instrumental rationality
This study proposes an agent-based model where adaptively learning agents with local vision who are situated in the Prisoner’s Dilemma game change their strategy and location as...
Jae-Woo Kim
ALGOSENSORS
2010
Springer
13 years 6 months ago
From Key Predistribution to Key Redistribution
One of crucial disadvantages of key predistribution schemes for ad hoc networks is that if devices A and B use a shared key K to determine their session keys, then any adversarial...
Jacek Cichon, Zbigniew Golebiewski, Miroslaw Kutyl...