Sciweavers

7988 search results - page 446 / 1598
» A Useful Undecidable Theory
Sort
View
CORR
2007
Springer
141views Education» more  CORR 2007»
15 years 6 months ago
Acyclicity of Preferences, Nash Equilibria, and Subgame Perfect Equilibria: a Formal and Constructive Equivalence
Abstract. Sequential game and Nash equilibrium are basic key concepts in game theory. In 1953, Kuhn showed that every sequential game has a Nash equilibrium. The two main steps of ...
Stéphane Le Roux
JSC
2010
103views more  JSC 2010»
15 years 5 months ago
Anti-patterns for rule-based languages
Negation is intrinsic to human thinking and most of the time when searching for something, we base our patterns on both positive and negative conditions. This should be naturally ...
Horatiu Cirstea, Claude Kirchner, Radu Kopetz, Pie...

Book
269views
17 years 5 months ago
Type Systems for Programming Languages
"These notes were prepared for use in the graduate course Computer Science 15– 814: Type Systems for Programming Languages at Carnegie Mellon University. Their purpose is ...
Robert Harper
FCT
2007
Springer
16 years 1 months ago
On Block-Wise Symmetric Signatures for Matchgates
We give a classification of block-wise symmetric signatures in the theory of matchgate computations. The main proof technique is matchgate identities, a.k.a. useful Grassmann-Pl¨...
Jin-yi Cai, Pinyan Lu
MFCS
2004
Springer
16 years 7 days ago
Approximating Boolean Functions by OBDDs
In learning theory and genetic programming, OBDDs are used to represent approximations of Boolean functions. This motivates the investigation of the OBDD complexity of approximatin...
Andre Gronemeier