Sciweavers

355 search results - page 46 / 71
» A general, fully distributed multi-agent planning algorithm
Sort
View
JSAC
2008
118views more  JSAC 2008»
15 years 3 months ago
Auction-Based Resource Allocation for Cooperative Communications
Abstract--Distributed and efficient resource allocation is critical for fully realizing the benefits of cooperative communications in large scale communication networks. This paper...
Jianwei Huang, Zhu Han, Mung Chiang, H. Vincent Po...
118
Voted
ATAL
2010
Springer
15 years 4 months ago
Heuristic search for identical payoff Bayesian games
Bayesian games can be used to model single-shot decision problems in which agents only possess incomplete information about other agents, and hence are important for multiagent co...
Frans A. Oliehoek, Matthijs T. J. Spaan, Jilles St...
144
Voted
ICS
2010
Tsinghua U.
15 years 6 months ago
Clustering performance data efficiently at massive scales
Existing supercomputers have hundreds of thousands of processor cores, and future systems may have hundreds of millions. Developers need detailed performance measurements to tune ...
Todd Gamblin, Bronis R. de Supinski, Martin Schulz...
108
Voted
TCOM
2010
106views more  TCOM 2010»
15 years 1 months ago
Achievable information rates for channels with insertions, deletions, and intersymbol interference with i.i.d. inputs
—We propose to use various trellis structures to characterize different types of insertion and deletion channels. We start with binary independent and identically distributed (i....
Jun Hu, Tolga M. Duman, M. Fatih Erden, Aleksandar...
133
Voted
CONEXT
2006
ACM
15 years 9 months ago
Shortcuts in a virtual world
We consider the case of a virtual world of peers that are organized in an overlay built by Delaunay Triangulation. Application layer routing is used to determine the path taken in...
Moritz Steiner, Ernst W. Biersack