6110 search results - page 198 / 1222 » Approximate Computing |
191
click to vote
FOCS
2007
IEEE
16 years 25 days ago
2007
IEEE
We consider a variant of the classic multi-armed bandit problem (MAB), which we call FEEDBACK MAB, where the reward obtained by playing each of n independent arms varies according...
193
click to vote
PODS
1999
ACM
15 years 10 months ago
1999
ACM
We investigate the problem of how to extend constraint query languages with aggregate operators. We deal with standard relational aggregation, and also with aggregates speci c to ...
169
click to vote
CP
2005
Springer
16 years 1 days ago
2005
Springer
Abstract. We present a parameterized approximation scheme for distributed combinatorial optimization problems based on dynamic programming. The algorithm is a utility propagation m...
143
click to vote
AUTOMATICA
2006
15 years 6 months ago
2006
This paper is concerned with outer approximations of the minimal disturbance invariant set (MDIS) of a discrete-time linear system with an additive set-bounded disturbance. The k-...
207
click to vote
SIGECOM
2009
ACM
16 years 1 months ago
2009
ACM
The literature on algorithmic mechanism design is mostly concerned with game-theoretic versions of optimization problems to which standard economic money-based mechanisms cannot b...