1142 search results - page 162 / 229 » Approximability of Clausal Constraints |
244
click to vote
FOCS
2007
IEEE
16 years 19 days ago
2007
IEEE
We study the role that privacy-preserving algorithms, which prevent the leakage of specific information about participants, can play in the design of mechanisms for strategic age...
185
click to vote
WINE
2007
Springer
16 years 12 days ago
2007
Springer
We introduce the concept of a trust network—a decentralized payment infrastructure in which payments are routed as IOUs between trusted entities. The trust network has directed ...
145
click to vote
FPL
2005
Springer
15 years 11 months ago
2005
Springer
This paper describes a method based on polynomial approximation for transferring ROM resources used in FPGA designs to multiplication and addition operations. The technique can be...
153
click to vote
ATAL
2004
Springer
15 years 11 months ago
2004
Springer
Decentralized MDPs provide a powerful formal framework for planning in multi-agent systems, but the complexity of the model limits its usefulness. We study in this paper a class o...
153
click to vote
AUSAI
2004
Springer
15 years 11 months ago
2004
Springer
Most propagation-based set constraint solvers approximate the set of possible sets that a variable can take by upper and lower bounds, and perform so-called set bounds propagation....