365 search results - page 12 / 73 » Solving the Multiplication Constraint in Several Approximati... |
IJCAI
2003
13 years 9 months ago
2003
Traditional single-agent search algorithms usually make simplifying assumptions (single search agent, stationary target, complete knowledge of the state, and sufficient time). The...
DCC
2002
IEEE
14 years 7 months ago
2002
IEEE
We show that the problem of optimal bit allocation among a set of independent discrete quantizers given a budget constraint is equivalent to the multiple choice knapsack problem (...
NIPS
2003
13 years 9 months ago
2003
We describe a new approximation algorithm for solving partially observable MDPs. Our bounded policy iteration approach searches through the space of bounded-size, stochastic fini...
TKDE
2008
13 years 7 months ago
2008
The multicampaign assignment problem is a campaign model to overcome the multiple-recommendation problem that occurs when conducting several personalized campaigns simultaneously. ...
ATAL
2010
Springer
13 years 2 months ago
2010
Springer
The Affine ADD (AADD) is an extension of the Algebraic Decision Diagram (ADD) that compactly represents context-specific, additive and multiplicative structure in functions from a...