1220 search results - page 57 / 244 » Restricting grammatical complexity |
STOC
2005
ACM
14 years 8 months ago
2005
ACM
Set agreement, where processors decisions constitute a set of outputs, is notoriously harder to analyze than consensus where the decisions are restricted to a single output. This ...
ISAAC
2009
Springer
14 years 2 months ago
2009
Springer
We consider some well-known families of two-player zero-sum perfect-information stochastic games played on finite directed graphs. Generalizing and unifying results of Liggett and...
SIGECOM
2005
ACM
14 years 1 months ago
2005
ACM
We study various computational aspects of solving games using dominance and iterated dominance. We first study both strict and weak dominance (not iterated), and show that checki...
SIAMCOMP
2011
13 years 2 months ago
2011
Set agreement, where processors decisions constitute a set of outputs, is notoriously harder to analyze than consensus where the decisions are restricted to a single output. This ...
AMSTERDAM
2009
13 years 5 months ago
2009
This paper offers an account of the semantics of count nous. I show that neither the atomic/nonatomic distinction nor the homogeneous/non-homogeneous distinction is sufficient to ...