Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
2,106
End-to-End Internet Packet Dynamics,”
- Proc. SIGCOMM '97,
, 1997
"... Abstract We discuss findings from a large-scale study of Internet packet dynamics conducted by tracing 20,000 TCP bulk transfers between 35 Internet sites. Because we traced each 100 Kbyte transfer at both the sender and the receiver, the measurements allow us to distinguish between the end-to-end ..."
Abstract
-
Cited by 843 (19 self)
- Add to MetaCart
" that addresses deficiencies discovered in techniques based on "packet pair"; investigate patterns of packet loss, finding that loss events are not well-modeled as independent and, furthermore, that the distribution of the duration of loss events exhibits infinite variance; and analyze variations
On the Synthesis of Strategies in Infinite Games
, 1995
"... . Infinite two-person games are a natural framework for the study of reactive nonterminating programs. The effective construction of winning strategies in such games is an approach to the synthesis of reactive programs. We describe the automata theoretic setting of infinite games (given by "gam ..."
Abstract
-
Cited by 192 (7 self)
- Add to MetaCart
. Infinite two-person games are a natural framework for the study of reactive nonterminating programs. The effective construction of winning strategies in such games is an approach to the synthesis of reactive programs. We describe the automata theoretic setting of infinite games (given by "game
On Fixed-Parameter Complexity of Infinite Games
, 2003
"... We investigate and classify fixed parameter complexity of several infinite duration games, including Rabin, Streett, Muller, parity, mean payoff, and simple stochastic, using different natural parameterizations. Most known fixed parameter intractable games are PSPACE- or EXP-complete classically, AW ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
We investigate and classify fixed parameter complexity of several infinite duration games, including Rabin, Streett, Muller, parity, mean payoff, and simple stochastic, using different natural parameterizations. Most known fixed parameter intractable games are PSPACE- or EXP-complete classically
Tree Automata, Mu-Calculus and Determinacy (Extended Abstract)
- IN PROCEEDINGS OF THE 32ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, FOCS ’91
, 1991
"... We show that the propositional Mu-Calculus is equivalent in expressive power to finite automata on infinite trees. Since complementation is trivial in the Mu-Calculus, our equivalence provides a radically simplified, alternative proof of Rabin's complementation lemma for tree automata, which is ..."
Abstract
-
Cited by 293 (4 self)
- Add to MetaCart
is the heart of one of the deepest decidability results. We also show how Mu-Calculus can be used to establish determinacy of infinite games used in earlier proofs of complementation lemma, and certain games used in the theory of on-line algorithms.
Infinite games on finitely coloured graphs with applications to automata on infinite trees
- Theoret. Comput. Sci
, 1998
"... ..."
Playing Pushdown Parity Games in a Hurry
"... We continue the investigation of finite-duration variants of infinite-duration games by extending known results for games played on finite graphs to those played on infinite ones. In particular, we establish an equivalence between pushdown parity games and a finite-duration variant. This allows us t ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
We continue the investigation of finite-duration variants of infinite-duration games by extending known results for games played on finite graphs to those played on infinite ones. In particular, we establish an equivalence between pushdown parity games and a finite-duration variant. This allows us
Infinite Coordination Games
"... We investigate the prescriptive power of sequential iterated admissibility in coordination games of the Gale-Stewart style, i.e., perfectinformation games of infinite duration with only two payoffs. We show that, on this kind of games, the procedure of eliminating weakly dominated strategies is inde ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
We investigate the prescriptive power of sequential iterated admissibility in coordination games of the Gale-Stewart style, i.e., perfectinformation games of infinite duration with only two payoffs. We show that, on this kind of games, the procedure of eliminating weakly dominated strategies
Playing Pushdown Parity Games in a Hurry (Extended Abstract)
- SUBMITTED TO: AISS 2012
, 2012
"... We continue the investigation of finite-duration variants of infinite-duration games by extending known results for games played on finite graphs to those played on infinite ones. In particular, we establish an equivalence between pushdown parity games and a finite-duration variant. This allows to d ..."
Abstract
- Add to MetaCart
We continue the investigation of finite-duration variants of infinite-duration games by extending known results for games played on finite graphs to those played on infinite ones. In particular, we establish an equivalence between pushdown parity games and a finite-duration variant. This allows
A subexponential lower bound for the Random Facet algorithm for Parity Games
"... Parity Games form an intriguing family of infinite duration games whose solution is equivalent to the solution of important problems in automatic verification and automata theory. They also form a very natural subclass of Deterministic Mean Payoff Games, which in turn is a very natural subclass of t ..."
Abstract
-
Cited by 6 (5 self)
- Add to MetaCart
Parity Games form an intriguing family of infinite duration games whose solution is equivalent to the solution of important problems in automatic verification and automata theory. They also form a very natural subclass of Deterministic Mean Payoff Games, which in turn is a very natural subclass
Finite Automata Play the Repeated Prisoner's Dilemma
- Journal of Economic Theory
, 1986
"... The paper studies two-person supergames. Each player is restricted to carry out his strategies by finite automata. A player’s aim is to maximize his average payoff and subject to that, to minimize the number of states of his machine. A solution is defined as a pair of machines in which the choice of ..."
Abstract
-
Cited by 214 (6 self)
- Add to MetaCart
of machine is optimal for each player at every stage of the game. Several properties of the solution are studied and are applied to the repeated prisoner’s dilemma. In particular it is shown that cooperation cannot be the outcome of a solution of the infinitely repeated prisoner’s
Results 1 - 10
of
2,106
