8699 search results - page 309 / 1740 » Elements of the Theory of Computation |
184
Voted
SIGECOM
2010
ACM
15 years 11 months ago
2010
ACM
We analyze the complexity of computing pure strategy Nash equilibria (PSNE) in symmetric games with a fixed number of actions. We restrict ourselves to “compact” representati...
182
click to vote
FCS
2006
15 years 8 months ago
2006
: We introduce an extended model for view-centric reasoning, EVCR, that provides more nsive and flexible abstractions for representing actual concurrency. The theory of Communicati...
166
click to vote
LPAR
2010
Springer
15 years 4 months ago
2010
Springer
We present a sound and complete model of lambda-calculus reductions based on structures inspired by modal logic (closely related to Kripke structures). Accordingly we can construct...
199
click to vote
IWOCA
2010
Springer
15 years 1 months ago
2010
Springer
A homomorphism from a graph G to a graph R is locally surjective if its restriction to the neighborhood of each vertex of G is surjective. Such a homomorphism is also called an R-r...
167
click to vote
ATAL
2009
Springer
16 years 1 months ago
2009
Springer
In this paper we describe MASQ (Multi-Agent Systems based on Quadrants), a model that defines four perspectives over an agent-based interaction according to two axes: internal/ex...