Sciweavers

355 search results - page 40 / 71
» A general, fully distributed multi-agent planning algorithm
Sort
View
ATAL
2008
Springer
15 years 5 months ago
Value-based observation compression for DEC-POMDPs
Representing agent policies compactly is essential for improving the scalability of multi-agent planning algorithms. In this paper, we focus on developing a pruning technique that...
Alan Carlin, Shlomo Zilberstein
157
Voted
SIGECOM
2010
ACM
170views ECommerce» more  SIGECOM 2010»
15 years 8 months ago
Optimal online assignment with forecasts
Motivated by the allocation problem facing publishers in display advertising we formulate the online assignment with forecast problem, a version of the online allocation problem w...
Erik Vee, Sergei Vassilvitskii, Jayavel Shanmugasu...
PVM
2004
Springer
15 years 9 months ago
Numerical Simulations on PC Graphics Hardware
On recent PC graphics cards, fully programmable parallel geometry and pixel units are available providing powerful instruction sets to perform arithmetic and logical operations. In...
Jens Krüger, Thomas Schiwietz, Peter Kipfer, ...
132
Voted
DAS
2008
Springer
15 years 5 months ago
Towards Whole-Book Recognition
We describe experimental results for unsupervised recognition of the textual contents of book-images using fully automatic mutual-entropy-based model adaptation. Each experiment s...
Pingping Xiu, Henry S. Baird
258
Voted
ICDE
2006
IEEE
156views Database» more  ICDE 2006»
16 years 4 months ago
Reasoning About Approximate Match Query Results
Join techniques deploying approximate match predicates are fundamental data cleaning operations. A variety of predicates have been utilized to quantify approximate match in such o...
Sudipto Guha, Nick Koudas, Divesh Srivastava, Xiao...