Sciweavers

4469 search results - page 117 / 894
» Dynamic Program Slicing
Sort
View
NIPS
2008
13 years 9 months ago
Biasing Approximate Dynamic Programming with a Lower Discount Factor
Most algorithms for solving Markov decision processes rely on a discount factor, which ensures their convergence. It is generally assumed that using an artificially low discount f...
Marek Petrik, Bruno Scherrer
SCHEDULING
2008
85views more  SCHEDULING 2008»
13 years 7 months ago
A dynamic programming algorithm for days-off scheduling with sequence dependent labor costs
This paper presents a dynamic programming (DP) algorithm for solving a labor scheduling problem with several realistic days-off scheduling constraints and a cost structure that dep...
Moustafa Elshafei, Hesham K. Alfares
ICIP
2010
IEEE
13 years 5 months ago
Video retargeting: A visual-friendly dynamic programming approach
Video retargeting is the task of fitting standard-sized video into arbitrary screen. A compelling retargeting attempts to preserve most visual information of original video as wel...
Zheng Yuan, Taoran Lu, Yu Huang, Dapeng Wu, Heathe...
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...
ISPD
2004
ACM
189views Hardware» more  ISPD 2004»
14 years 1 months ago
Almost optimum placement legalization by minimum cost flow and dynamic programming
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...
Ulrich Brenner, Anna Pauli, Jens Vygen