Sciweavers

4074 search results - page 89 / 815
» Abstract Graph Transformation
Sort
View
JGAA
2007
123views more  JGAA 2007»
14 years 10 months ago
A Polynomial Time Algorithm for Finding Nash Equilibria in Planar Win-Lose Games
Abstract. Two-player win-lose games have a simple directed graph representation. Exploiting this, we develop graph theoretic techniques for finding Nash equilibria in such games. ...
Louigi Addario-Berry, Neil Olver, Adrian Vetta
COMBINATORICS
1999
92views more  COMBINATORICS 1999»
14 years 9 months ago
Nim-Regularity of Graphs
Abstract. Ehrenborg and Steingr
Nathan Reading
GG
2008
Springer
14 years 11 months ago
Behavior Preservation in Model Refactoring Using DPO Transformations with Borrowed Contexts
Behavior preservation, namely the fact that the behavior of a model is not altered by the transformations, is a crucial property in refactoring. The most common approaches to behav...
Guilherme Rangel, Leen Lambers, Barbara König...
GG
2008
Springer
14 years 11 months ago
Graph-Based Tools: The Contest
This event is the second instance of the contest for graph transformation-based tools, which was first held as part of the AGTIVE workshop. The aim is to stimulate tool developmen...
Arend Rensink, Pieter Van Gorp
KCAP
2003
ACM
15 years 3 months ago
Using transformations to improve semantic matching
Many AI tasks require determining whether two knowledge representations encode the same knowledge. Solving this matching problem is hard because representations may encode the sam...
Peter Z. Yeh, Bruce W. Porter, Ken Barker