Sciweavers

67 search results - page 7 / 14
» Succinct Representations of Arbitrary Graphs
Sort
View
CORR
2010
Springer
137views Education» more  CORR 2010»
14 years 11 months ago
Open Graphs and Monoidal Theories
String diagrams are a powerful tool for reasoning about physical processes, logic circuits, tensor networks, and many other compositional structures. The distinguishing feature of...
Lucas Dixon, Aleks Kissinger
CONCUR
2008
Springer
15 years 1 months ago
Strategy Construction for Parity Games with Imperfect Information
We consider imperfect-information parity games in which strategies rely on observations that provide imperfect information about the history of a play. To solve such games, i.e., t...
Dietmar Berwanger, Krishnendu Chatterjee, Laurent ...
106
Voted
AAAI
2010
15 years 1 months ago
Coalitional Structure Generation in Skill Games
We consider optimizing the coalition structure in Coalitional Skill Games (CSGs), a succinct representation of coalitional games (Bachrach and Rosenschein 2008). In CSGs, the valu...
Yoram Bachrach, Reshef Meir, Kyomin Jung, Pushmeet...
ADAEUROPE
2008
Springer
15 years 6 months ago
A Framework for CFG-Based Static Program Analysis of Ada Programs
Abstract. The control flow graph is the basis for many code optimisation and analysis techniques. We introduce a new framework for the construction of powerful CFG-based represent...
Raul Fechete, Georg Kienesberger, Johann Blieberge...
108
Voted
UAI
2004
15 years 1 months ago
Computing Nash Equilibria of Action-Graph Games
Action-graph games (AGGs) are a fully expressive game representation which can compactly express both strict and context-specific independence between players' utility functi...
Navin A. R. Bhat, Kevin Leyton-Brown