730 search results - page 43 / 146 » Combinatorics of Monotone Computations |
SIGECOM
2010
ACM
14 years 1 months ago
2010
ACM
It is widely believed that computing payments needed to induce truthful bidding is somehow harder than simply computing the allocation. We show that the opposite is true for singl...
COMBINATORICS
1998
13 years 8 months ago
1998
Voltage graphs are a powerful tool for constructing large graphs (called lifts) with prescribed properties as covering spaces of small base graphs. This makes them suitable for ap...
COMBINATORICS
1999
13 years 8 months ago
1999
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...
DEBS
2003
ACM
14 years 1 months ago
2003
ACM
We present a design of a distributed publish-subscribe system that extends the functionality of messaging middleware with “relational subscriptions”, to support timely updates...
IJCAI
2007
13 years 10 months ago
2007
In recent years, the combinatorics of argumentation with arguments that can attack each other has been studied extensively. Especially, attack graphs (put in the focus of attentio...