2168 search results - page 67 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
141
Voted
JAIR
2010
15 years 2 months ago
2010
We develop multiattribute auctions that accommodate generalized additive independent (GAI) preferences. We propose an iterative auction mechanism that maintains prices on potentia...
104
click to vote
FSTTCS
2009
Springer
15 years 10 months ago
2009
Springer
ABSTRACT. We study functionally private approximations. An approximation function g is functionally private with respect to f if, for any input x, g(x) reveals no more information ...
136
click to vote
CDC
2010
IEEE
14 years 10 months ago
2010
IEEE
Approximate policy iteration methods based on temporal differences are popular in practice, and have been tested extensively, dating to the early nineties, but the associated conve...
107
Voted
ICFCA
2007
Springer
15 years 9 months ago
2007
Springer
We model a Digital Library as a formal context in which objects are documents and attributes are terms describing documents contents. A formal concept is very close to the notion o...
117
Voted
AAAI
2007
15 years 5 months ago
2007
Developing scalable coordination algorithms for multi-agent systems is a hard computational challenge. One useful approach, demonstrated by the Coverage Set Algorithm (CSA), explo...