Sciweavers

2038 search results - page 52 / 408
» Loops under Strategies
Sort
View
JCT
2011
71views more  JCT 2011»
13 years 2 months ago
Pseudograph associahedra
Given a simple graph G, the graph associahedron KG is a simple polytope whose face poset is based on the connected subgraphs of G. This paper defines and constructs graph associah...
Michael Carr, Satyan L. Devadoss, Stefan Forcey
ISAAC
2005
Springer
127views Algorithms» more  ISAAC 2005»
14 years 1 months ago
Counting Stable Strategies in Random Evolutionary Games
In this paper we study the notion of the Evolutionary Stable Strategies (ESS) in evolutionary games and we demonstrate their qualitative difference from the Nash Equilibria, by sh...
Spyros C. Kontogiannis, Paul G. Spirakis
RSA
2011
92views more  RSA 2011»
13 years 2 months ago
Highly nonrepetitive sequences: Winning strategies from the local lemma
We prove game-theoretic versions of several classical results on nonrepetitive sequences, showing the existence of winning strategies using an extension of the Local Lemma which c...
Wesley Pegden
INFOCOM
2008
IEEE
14 years 2 months ago
On the Performance of IEEE 802.11 under Jamming
—In this paper, we study the performance of the IEEE 802.11 MAC protocol under a range of jammers that covers both channel-oblivious and channel-aware jamming. We study two chann...
Emrah Bayraktaroglu, Christopher King, Xin Liu, Gu...
HPCN
2000
Springer
13 years 11 months ago
An Analytical Model for a Class of Architectures under Master-Slave Paradigm
We build an analytical model for an application utilizing master-slave paradigm. In the model, only three architecture parameters are used: latency, bandwidth and flop rate. Instea...
Yasemin Yalçinkaya, Trond Steihaug