3341 search results - page 228 / 669 » On Bounded Queries and Approximation |
161
click to vote
IPMU
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. Credal sets are closed convex sets of probability mass functions. The lower probabilities specified by a credal set for each element of the power set can be used as cons...
199
Voted
JMLR
2011
15 years 1 months ago
2011
We consider the problem of improving the Gaussian approximate posterior marginals computed by expectation propagation and the Laplace method in latent Gaussian models and propose ...
192
click to vote
RTSS
2005
IEEE
16 years 6 days ago
2005
IEEE
We consider the scheduling of a sporadic real-time task system on an identical multiprocessor. Though Pfair algorithms are theoretically optimal for such task systems, in practice...
214
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...
198
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
Approximate dynamic programming has been used successfully in a large variety of domains, but it relies on a small set of provided approximation features to calculate solutions re...