Sciweavers

376 search results - page 23 / 76
» Self-Stabilizing Graph Protocols
Sort
View
COMMA
2008
15 years 6 months ago
Applying Preferences to Dialogue Graphs
An abstract framework for formalising persuasion dialogues has recently been proposed. The framework provides for a range of speech acts, and protocols of varying levels of flexibi...
Sanjay Modgil, Henry Prakken
WONS
2005
IEEE
15 years 10 months ago
Frequency Allocation for WLANs Using Graph Colouring Techniques
At present, no standard frequency allocation mechanism exists for Wireless LAN access points. In this article, we introduce a number of techniques based on graph colouring algorit...
Janne Riihijärvi, Marina Petrova, Petri M&aum...
159
Voted
GLOBECOM
2007
IEEE
15 years 11 months ago
Colouring Link-Directional Interference Graphs in Wireless Ad Hoc Networks
—In this paper, we clarify inter-link interference in wireless ad-hoc networks by using link-directional interference graphs (l-graph). Most of the interference graphs in the lit...
Ping Chung Ng, David J. Edwards, Soung Chang Liew
173
Voted
INFOCOM
2010
IEEE
15 years 2 months ago
A Greedy Link Scheduler for Wireless Networks with Gaussian Multiple Access and Broadcast Channels
Information theoretic Broadcast Channels (BC) and Multiple Access Channels (MAC) enable a single node to transmit data simultaneously to multiple nodes, and multiple nodes to trans...
Arun Sridharan, Can Emre Koksal, Elif Uysal-Biyiko...
INFOCOM
2011
IEEE
14 years 8 months ago
SigSag: Iterative detection through soft message-passing
—The multiple-access framework of ZigZag decoding [1] is a useful technique for combating interference via multiple repeated transmissions, and is known to be compatible with dis...
Arash Saber Tehrani, Alexandros G. Dimakis, Michae...