1277 search results - page 39 / 256 » Terminating Decision Algorithms Optimally |
123
click to vote
UAI
2000
15 years 4 months ago
2000
A simple advertising strategy that can be used to help increase sales of a product is to mail out special o ers to selected potential customers. Because there is a cost associated...
109
click to vote
ALT
2008
Springer
15 years 12 months ago
2008
Springer
Abstract. We consider an upper confidence bound algorithm for Markov decision processes (MDPs) with deterministic transitions. For this algorithm we derive upper bounds on the onl...
145
click to vote
STOC
2010
ACM
15 years 7 months ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
112
click to vote
CISS
2007
IEEE
15 years 9 months ago
2007
IEEE
Abstract—This paper presents a novel zero-sum watermarking game between a detection algorithm and a data hiding adversary. Contrary to previous research, the detection algorithm ...
GECCO
2006
Springer
15 years 6 months ago
2006
Springer
This paper presents four rotatable multi-objective test problems that are designed for testing EMO (Evolutionary Multiobjective Optimization) algorithms on their ability in dealin...