24 search results - page 4 / 5 » What makes some POMDP problems easy to approximate |
CIKM
2007
Springer
13 years 11 months ago
2007
Springer
We present a research effort into the application of semantic web methods and technologies to address the challenging problem of integrating heterogeneous volcanic and atmospheri...
ML
2006
ACM
13 years 5 months ago
2006
ACM
Most game programs have a large number of parameters that are crucial for their performance. While tuning these parameters by hand is rather difficult, efficient and easy to use ge...
CCO
2001
Springer
13 years 9 months ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
SIGMOD
2007
ACM
14 years 5 months ago
2007
ACM
Sketching techniques can provide approximate answers to aggregate queries either for data-streaming or distributed computation. Small space summaries that have linearity propertie...
STOC
2005
ACM
14 years 5 months ago
2005
ACM
We study an extension of the "standard" learning models to settings where observing the value of an attribute has an associated cost (which might be different for differ...