Sciweavers

1698 search results - page 47 / 340
» Growing Complex Games
Sort
View
TCS
2010
14 years 8 months ago
Analyzing the dynamics of stigmergetic interactions through pheromone games
The concept of stigmergy provides a simple framework for interaction and coordination in multi-agent systems. However, determining the global system behavior that will arise from ...
Peter Vrancx, Katja Verbeeck, Ann Nowé
AAAI
2012
13 years 4 days ago
Computing Optimal Strategies to Commit to in Stochastic Games
Significant progress has been made recently in the following two lines of research in the intersection of AI and game theory: (1) the computation of optimal strategies to commit ...
Joshua Letchford, Liam MacDermed, Vincent Conitzer...
ICC
2007
IEEE
137views Communications» more  ICC 2007»
15 years 4 months ago
Optimality and Complexity of Opportunistic Spectrum Access: A Truncated Markov Decision Process Formulation
— We consider opportunistic spectrum access (OSA) which allows secondary users to identify and exploit instantaneous spectrum opportunities resulting from the bursty traffic of ...
Dejan V. Djonin, Qing Zhao, Vikram Krishnamurthy
ICC
2009
IEEE
143views Communications» more  ICC 2009»
15 years 4 months ago
Low Complexity Markov Chain Monte Carlo Detector for Channels with Intersymbol Interference
— In this paper, we propose a novel low complexity soft-in soft-out (SISO) equalizer using the Markov chain Monte Carlo (MCMC) technique. Direct application of MCMC to SISO equal...
Ronghui Peng, Rong-Rong Chen, Behrouz Farhang-Boro...
WSC
2000
14 years 11 months ago
On simulation model complexity
Nowadays the size and complexity of models is growing more and more, forcing modelers to face some problems that they were not accustomed to. Before trying to study ways to deal w...
Leonardo Chwif, Marcos Ribeiro Pereira Barretto, R...