Sciweavers

56 search results - page 6 / 12
» A case for unlimited watchpoints
Sort
View
EUROCRYPT
2012
Springer
11 years 10 months ago
Fully Homomorphic Encryption with Polylog Overhead
We show that homomorphic evaluation of (wide enough) arithmetic circuits can be accomplished with only polylogarithmic overhead. Namely, we present a construction of fully homomorp...
Craig Gentry, Shai Halevi, Nigel P. Smart
AMEC
2004
Springer
14 years 1 months ago
Multi-attribute Bilateral Bargaining in a One-to-Many Setting
Negotiations are an important way of reaching agreements between selfish autonomous agents. In this paper we focus on one-to-many bargaining within the context of agent-mediated e...
Enrico H. Gerding, D. J. A. Somefun, Han La Poutr&...
TCS
2008
13 years 7 months ago
Self-deployment of mobile sensors on a ring
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
CP
2007
Springer
14 years 1 months ago
Limitations of Restricted Branching in Clause Learning
The techniques for making decisions, i.e., branching, play a central role in complete methods for solving structured CSP instances. In practice, there are cases when SAT solvers be...
Matti Järvisalo, Tommi A. Junttila
ESA
2007
Springer
89views Algorithms» more  ESA 2007»
14 years 1 months ago
Bundle Pricing with Comparable Items
We consider a revenue maximization problem where we are selling a set of comparable items, each available in a certain quantity (possibly unlimited) to a set of bidders. Each bidde...
Alexander Grigoriev, Joyce van Loon, Maxim Sviride...