Sciweavers

697 search results - page 60 / 140
» Convex Functions on Discrete Sets
Sort
View
AAAI
2006
13 years 10 months ago
Learning Basis Functions in Hybrid Domains
Markov decision processes (MDPs) with discrete and continuous state and action components can be solved efficiently by hybrid approximate linear programming (HALP). The main idea ...
Branislav Kveton, Milos Hauskrecht
SODA
2008
ACM
138views Algorithms» more  SODA 2008»
13 years 10 months ago
Fully polynomial time approximation schemes for stochastic dynamic programs
We develop a framework for obtaining Fully Polynomial Time Approximation Schemes (FPTASs) for stochastic univariate dynamic programs with either convex or monotone single-period c...
Nir Halman, Diego Klabjan, Chung-Lun Li, James B. ...
ENTCS
2006
162views more  ENTCS 2006»
13 years 8 months ago
Continuous Functions on Final Coalgebras
It can be traced back to Brouwer that continuous functions of type StrA B, where StrA is the type of infinite streams over elements of A, can be represented by well founded, Abra...
Neil Ghani, Peter Hancock, Dirk Pattinson
ADCM
2010
59views more  ADCM 2010»
13 years 9 months ago
Sampling inequalities for infinitely smooth functions, with applications to interpolation and machine learning
Sampling inequalities give a precise formulation of the fact that a differentiable function cannot attain large values, if its derivatives are bounded and if it is small on a suff...
Christian Rieger, Barbara Zwicknagl
MOR
2008
169views more  MOR 2008»
13 years 8 months ago
The Flow Set with Partial Order
The flow set with partial order is a mixed-integer set described by a budget on total flow and a partial order on the arcs that may carry positive flow. This set is a common substr...
Alper Atamtürk, Muhong Zhang