Sciweavers

286 search results - page 20 / 58
» Weak Ordering - A New Definition
Sort
View
AAAI
2012
11 years 10 months ago
Planning in Factored Action Spaces with Symbolic Dynamic Programming
We consider symbolic dynamic programming (SDP) for solving Markov Decision Processes (MDP) with factored state and action spaces, where both states and actions are described by se...
Aswin Raghavan, Saket Joshi, Alan Fern, Prasad Tad...
SAC
2006
ACM
14 years 1 months ago
Trust-decisions on the base of maximal information of recommended direct-trust
Nowadays the concept of trust in computer communications starts to get more and more popular. While the idea of trust in human interaction seems to be obvious and understandable i...
Uwe Roth, Volker Fusenig
MICCAI
1999
Springer
14 years 4 days ago
Understanding the "Demon's Algorithm": 3D Non-rigid Registration by Gradient Descent
The “Demons Algorithm” in increasingly used for non-rigid registration of 3D medical images. However, if it is fast and usually accurate, the algorithm is based on intuitive id...
Xavier Pennec, Pascal Cachier, Nicholas Ayache
AIPS
2003
13 years 9 months ago
Guided Symbolic Universal Planning
Symbolic universal planning based on the reduced Ordered Binary Decision Diagram (OBDD) has been shown to be an efficient approach for planning in non-deterministic domains. To d...
Rune M. Jensen, Manuela M. Veloso, Randal E. Bryan...
MASCOTS
2003
13 years 9 months ago
Computer Virus Propagation Models
Abstract. The availability of reliable models of computer virus propagation would prove useful in a number of ways, in order both to predict future threats, and to develop new cont...
Giuseppe Serazzi, Stefano Zanero