337 search results - page 22 / 68 » An Anytime Algorithm for Decision Making under Uncertainty |
CEAS
2006
Springer
13 years 11 months ago
2006
Springer
One of the biggest challenges in building effective anti-spam solutions is designing systems to defend against the everevolving bag of tricks spammers use to defeat them. Because ...
INFOCOM
1997
IEEE
13 years 11 months ago
1997
IEEE
We investigate the problem of routing connections with QoS requirements across one or more networks, when the information available for making routing decisions is inaccurate and ...
NIPS
2007
13 years 9 months ago
2007
Point-based algorithms have been surprisingly successful in computing approximately optimal solutions for partially observable Markov decision processes (POMDPs) in high dimension...
ICDE
2009
IEEE
14 years 9 months ago
2009
IEEE
Abstract-- We consider a novel problem of top-k query processing under budget constraints. We provide both a framework and a set of algorithms to address this problem. Existing alg...
APPROX
2005
Springer
14 years 1 months ago
2005
Springer
The field of stochastic optimization studies decision making under uncertainty, when only probabilistic information about the future is available. Finding approximate solutions to...