The central problem in computational mechanism design is the tension between incentive compatibility and computational ef ciency. We establish the rst significant approximability ...
Christos H. Papadimitriou, Michael Schapira, Yaron...
Abstract. The same methodology is used to develop 3 different applications. We begin by using a very expressive, appropriate Domain Specific Language, to write down precise problem...
Jacques Carette, Spencer Smith, John McCutchan, Ch...
Mobile sensors can self-deploy in a purely decentralized and distributed fashion, so to reach in finite time a state of static equilibrium in which they cover uniformly the enviro...
Paola Flocchini, Giuseppe Prencipe, Nicola Santoro
Abstract. Many interesting problems in computer vision can be formulated as a minimization problem for an energy functional. If this functional is given as an integral of a scalar-...
The classical NP-complete problem of Boolean Satisfiability (SAT) has seen much interest in not just the theoretical computer science community, but also in areas where practical s...