Sciweavers

5608 search results - page 193 / 1122
» On the Theory of Matchgate Computations
Sort
View
SIGECOM
2010
ACM
184views ECommerce» more  SIGECOM 2010»
15 years 6 months ago
Computing pure strategy nash equilibria in compact symmetric games
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...
Christopher Thomas Ryan, Albert Xin Jiang, Kevin L...
114
Voted
FCS
2006
15 years 3 months ago
From Sequential Processes to Grid Computation
: 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...
Mark Burgin, Marc Smith
135
Voted
CICLING
2003
Springer
15 years 7 months ago
Computing with Realizational Morphology
The theory of realizational morphology presented by Stump in his influential book Inflectional Morphology (2001) describes the derivation of inflected surface forms from underly...
Lauri Karttunen
120
Voted
EUROCAST
2001
Springer
106views Hardware» more  EUROCAST 2001»
15 years 6 months ago
On CAST.FSM Computation of Hierarchical Multi-layer Networks of Automata
CAST.FSM denotes a CAST tool which has been developed at the Institute of Systems Science at the University of Linz during the years 1986-1993. The first version of CAST.FSM was i...
Michael Affenzeller, Franz Pichler, Rudolf Mittelm...
JACIII
2007
79views more  JACIII 2007»
15 years 1 months ago
State-Transition Computation Models and Program Correctness Thereon
Abstract— A common framework for formalization of statetransition computation models is presented based on a general theory for studying the interrelationships between specifica...
Kiyoshi Akama, Ekawit Nantajeewarawat