Sciweavers

2976 search results - page 168 / 596
» On the bounded integer programming
Sort
View
NIPS
2007
15 years 7 months ago
Optimistic Linear Programming gives Logarithmic Regret for Irreducible MDPs
We present an algorithm called Optimistic Linear Programming (OLP) for learning to optimize average reward in an irreducible but otherwise unknown Markov decision process (MDP). O...
Ambuj Tewari, Peter L. Bartlett
NIPS
2008
15 years 7 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
CP
2005
Springer
15 years 12 months ago
Bounds of Graph Characteristics
Abstract. This report presents a basic scheme for deriving systematically a filtering algorithm from the graph properties based representation of global constraints. This scheme i...
Nicolas Beldiceanu, Thierry Petit, Guillaume Rocha...
JCT
2007
134views more  JCT 2007»
15 years 6 months ago
Improved Delsarte bounds for spherical codes in small dimensions
ABSTRACT. We present an extension of the Delsarte linear programming method for spherical codes. For several dimensions it yields improved upper bounds including some new bounds on...
Florian Pfender
IJCAI
2007
15 years 7 months ago
A Faithful Integration of Description Logics with Logic Programming
Integrating description logics (DL) and logic programming (LP) would produce a very powerful and useful formalism. However, DLs and LP are based on quite different principles, so ...
Boris Motik, Riccardo Rosati