Sciweavers

1426 search results - page 131 / 286
» A theory of goal-oriented communication
Sort
View
SODA
2010
ACM
151views Algorithms» more  SODA 2010»
15 years 11 months ago
A Max-Flow/Min-Cut Algorithm for a Class of Wireless Networks
The linear deterministic model of relay channels is a generalization of the traditional directed network model which has become popular in the study of the flow of information ove...
S. M. Sadegh Tabatabaei Yazdi, Serap A. Savari
FASE
2009
Springer
15 years 8 months ago
Transformation of Type Graphs with Inheritance for Ensuring Security in E-Government Networks
Abstract. E-government services usually process large amounts of confidential data. Therefore, security requirements for the communication between components have to be adhered in...
Frank Hermann, Hartmut Ehrig, Claudia Ermel
SIGDOC
2009
ACM
15 years 8 months ago
Formalization and community investment in wikipedia's regulating texts: the role of essays
This poster presents ongoing research on how discursive and editing behaviors are regulated on Wikipedia by means of documented rules and practices. Our analysis focuses on three ...
Jonathan T. Morgan, Katie Derthick, Toni Ferro, El...
VTC
2007
IEEE
192views Communications» more  VTC 2007»
15 years 8 months ago
Access Scheduling Based on Time Water-Filling for Next Generation Wireless LANs
Opportunistic user access scheduling enhances the capacity of wireless networks by exploiting the multi user diversity. When frame aggregation is used, opportunistic schemes are no...
Ertugrul Necdet Ciftcioglu, Özgür Gü...
104
Voted
ATAL
2007
Springer
15 years 7 months ago
On the robustness of preference aggregation in noisy environments
In an election held in a noisy environment, agents may unintentionally perturb the outcome by communicating faulty preferences. We investigate this setting by introducing a theore...
Ariel D. Procaccia, Jeffrey S. Rosenschein, Gal A....