Sciweavers

915 search results - page 150 / 183
» Maximally Abstract Retrenchments
Sort
View
CORR
2010
Springer
189views Education» more  CORR 2010»
14 years 12 months ago
Approaching Throughput-optimality in Distributed CSMA Scheduling Algorithms with Collisions
Abstract--It was shown recently that carrier sense multiple access (CSMA)-like distributed algorithms can achieve the maximal throughput in wireless networks (and task processing n...
Libin Jiang, Jean C. Walrand
AAMAS
2006
Springer
14 years 12 months ago
Handling Communication Restrictions and Team Formation in Congestion Games
Abstract. There are many domains in which a multi-agent system needs to maximize a "system utility" function which rates the performance of the entire system, while subje...
Adrian K. Agogino, Kagan Tumer
CORR
2006
Springer
92views Education» more  CORR 2006»
14 years 12 months ago
Myopic Coding in Wireless Networks
Abstract -We investigate the achievable rate of data transmission from sources to sinks through a multiple-relay network. We study achievable rates for omniscient coding, in which ...
Lawrence Ong, Mehul Motani
CORR
2006
Springer
108views Education» more  CORR 2006»
14 years 12 months ago
Scheduling and Codeword Length Optimization in Time Varying Wireless Networks
Abstract-- In this paper, a downlink scenario in which a singleantenna base station communicates with K single antenna users, over a time-correlated fading channel, is considered. ...
Mehdi Ansari Sadrabadi, Alireza Bayesteh, Amir K. ...
GEOINFORMATICA
2006
102views more  GEOINFORMATICA 2006»
14 years 11 months ago
Mining Co-Location Patterns with Rare Events from Spatial Data Sets
Abstract A co-location pattern is a group of spatial features/events that are frequently co-located in the same region. For example, human cases of West Nile Virus often occur in r...
Yan Huang, Jian Pei, Hui Xiong