Sciweavers

136 search results - page 13 / 28
» Succinct Representation of Labeled Graphs
Sort
View
CORR
2010
Springer
137views Education» more  CORR 2010»
13 years 7 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
FLAIRS
2006
13 years 9 months ago
Inexact Graph Matching: A Case of Study
Inexact graph matching has become an important research area because it is used to find similarities among objects in several real domains such as chemical and biological compound...
Ivan Olmos, Jesus A. Gonzalez, Mauricio Osorio
CONCUR
2008
Springer
13 years 9 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 ...
AAAI
2010
13 years 9 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...
ECAI
2008
Springer
13 years 9 months ago
BIDFLOW: a New Graph-Based Bidding Language for Combinatorial Auctions
In this paper we introduce a new graph based bidding language for combinatorial auctions. In our language, each bidder submits to the arbitrator a generalized flow network (netbid...
Madalina Croitoru, Cornelius Croitoru, Paul H. Lew...