Sciweavers

1688 search results - page 129 / 338
» The Complexity of Rationalizing Matchings
Sort
View
ATAL
2008
Springer
15 years 7 months ago
Copeland voting: ties matter
We study the complexity of manipulation for a family of election systems derived from Copeland voting via introducing a parameter that describes how ties in head-to-head contests...
Piotr Faliszewski, Edith Hemaspaandra, Henning Sch...
SEMWEB
2009
Springer
16 years 11 days ago
Results of GeRoMeSuite for OAEI 2009
GeRoMeSuite is a generic model management system which provides several functions for managing complex data models, such as schema integration, definition and execution of schema ...
Christoph Quix, Sandra Geisler, David Kensche, Xia...
BMCBI
2011
14 years 9 months ago
Structator: fast index-based search for RNA sequence-structure patterns
Background: The secondary structure of RNA molecules is intimately related to their function and often more conserved than the sequence. Hence, the important task of searching dat...
Fernando Meyer, Stefan Kurtz, Rolf Backofen, Sebas...
WWW
2008
ACM
16 years 6 months ago
Dynamic cost-per-action mechanisms and applications to online advertising
We study the Cost-Per-Action or Cost-Per-Acquisition (CPA) charging scheme in online advertising. In this scheme, instead of paying per click, the advertisers pay only when a user...
Hamid Nazerzadeh, Amin Saberi, Rakesh Vohra
CIAC
2010
Springer
376views Algorithms» more  CIAC 2010»
16 years 3 months ago
Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights
In this paper we consider a natural generalization of the well-known Max Leaf Spanning Tree problem. In the generalized Weighted Max Leaf problem we get as input an undirected co...
Bart Jansen