Sciweavers

672 search results - page 20 / 135
» Policy Search by Dynamic Programming
Sort
View
ASIAN
2006
Springer
153views Algorithms» more  ASIAN 2006»
13 years 11 months ago
Automata-Based Confidentiality Monitoring
Abstract Non-interference is typically used as a baseline security policy to formalize confidentiality of secret information manipulated by a program. In contrast to static checkin...
Gurvan Le Guernic, Anindya Banerjee, Thomas P. Jen...
ICRA
2009
IEEE
132views Robotics» more  ICRA 2009»
14 years 2 months ago
Smoothed Sarsa: Reinforcement learning for robot delivery tasks
— Our goal in this work is to make high level decisions for mobile robots. In particular, given a queue of prioritized object delivery tasks, we wish to find a sequence of actio...
Deepak Ramachandran, Rakesh Gupta
MVA
1996
129views Computer Vision» more  MVA 1996»
13 years 9 months ago
Computation of Optical Flow Using Dynamic Programming
This paper presents an original algorithm for the computation of optical ow called Orthogonal Dynamic Programming (ODP) as well as several enhancements to it. The principle is to ...
Georges Quénot
CP
1998
Springer
13 years 12 months ago
Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems
We use a local search method we term Large Neighbourhood Search (LNS) for solving vehicle routing problems. LNS meshes well with constraint programming technology and is analogous...
Paul Shaw
AI
2000
Springer
13 years 7 months ago
Stochastic dynamic programming with factored representations
Markov decisionprocesses(MDPs) haveproven to be popular models for decision-theoretic planning, but standard dynamic programming algorithms for solving MDPs rely on explicit, stat...
Craig Boutilier, Richard Dearden, Moisés Go...