Sciweavers

380 search results - page 49 / 76
» Instance Matching with COMA
Sort
View
CORR
2010
Springer
118views Education» more  CORR 2010»
13 years 7 months ago
Automatically Discovering Hidden Transformation Chaining Constraints
Abstract. Model transformations operate on models conforming to precisely defined metamodels. Consequently, it often seems relatively easy to chain them: the output of a transforma...
Raphaël Chenouard, Frédéric Jou...
COMBINATORICS
1999
90views more  COMBINATORICS 1999»
13 years 7 months ago
On the Theory of Pfaffian Orientations. II. T-joins, k-cuts, and Duality of Enumeration
This is a continuation of our paper "A Theory of Pfaffian Orientations I: Perfect Matchings and Permanents". We present a new combinatorial way to compute the generating...
Anna Galluccio, Martin Loebl
SIGECOM
2010
ACM
201views ECommerce» more  SIGECOM 2010»
14 years 14 days ago
Truthful assignment without money
We study the design of truthful mechanisms that do not use payments for the generalized assignment problem (GAP) and its variants. An instance of the GAP consists of a bipartite g...
Shaddin Dughmi, Arpita Ghosh
DAGSTUHL
2007
13 years 9 months ago
Signalling Preferences in Interviewing Markets
The process of match formation in matching markets can be divided into three parts: information sharing, investments in information acquisition, and the formation of matches based...
Robin S. Lee, Michael A. Schwarz
JSC
2010
103views more  JSC 2010»
13 years 6 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...