Sciweavers

301 search results - page 14 / 61
» On the Optimality of Probability Estimation by Random Decisi...
Sort
View
AAAI
1996
13 years 9 months ago
Forward Estimation for Game-Tree Search
It is known that bounds on the minimax values of nodes in a game tree can be used to reduce the computational complexity of minimax search for two-player games. We describe a very...
Weixiong Zhang
IWSEC
2010
Springer
13 years 6 months ago
Optimal Adversary Behavior for the Serial Model of Financial Attack Trees
Abstract. Attack tree analysis is used to estimate different parameters of general security threats based on information available for atomic subthreats. We focus on estimating the...
Margus Niitsoo
ICIP
2005
IEEE
14 years 9 months ago
Bayesian face detection in an image sequence using face probability gradient ascent
Face detection in an image sequence is a challenging problem for many applications. In this paper, a novel face detection method is proposed. In order to detect faces in a sequenc...
Jae Hee Park, Hae-Chul Choi, Seong-Dae Kim
AIPS
2009
13 years 9 months ago
Efficient Solutions to Factored MDPs with Imprecise Transition Probabilities
When modeling real-world decision-theoretic planning problems in the Markov decision process (MDP) framework, it is often impossible to obtain a completely accurate estimate of tr...
Karina Valdivia Delgado, Scott Sanner, Leliane Nun...
SODA
1998
ACM
104views Algorithms» more  SODA 1998»
13 years 9 months ago
On-line Randomized Call Control Revisited
We consider the problem of on-line call admission and routing on trees and meshes. Previous work gave randomized on-line algorithms for these problems and proved that they have opt...
Stefano Leonardi, Alberto Marchetti-Spaccamela, Al...