Sciweavers

697 search results - page 8 / 140
» Convex Functions on Discrete Sets
Sort
View
AIPS
2004
13 years 11 months ago
Heuristic Refinements of Approximate Linear Programming for Factored Continuous-State Markov Decision Processes
Approximate linear programming (ALP) offers a promising framework for solving large factored Markov decision processes (MDPs) with both discrete and continuous states. Successful ...
Branislav Kveton, Milos Hauskrecht
COCOS
2003
Springer
148views Optimization» more  COCOS 2003»
14 years 3 months ago
Convex Programming Methods for Global Optimization
We investigate some approaches to solving nonconvex global optimization problems by convex nonlinear programming methods. We assume that the problem becomes convex when selected va...
John N. Hooker
COMPGEOM
1992
ACM
14 years 1 months ago
Piercing Convex Sets
A family of sets has the (p, q) property if among any p members of the family some q have a nonempty intersection. It is shown that for every p q d + 1 there is a c = c(p, q, d)...
Noga Alon, Daniel J. Kleitman
CORR
2007
Springer
85views Education» more  CORR 2007»
13 years 9 months ago
Minimization of entropy functionals
Entropy (i.e. convex integral) functionals and extensions of these functionals are minimized on convex sets. This paper is aimed at reducing as much as possible the assumptions on ...
Christian Léonard
GMP
2000
IEEE
117views Solid Modeling» more  GMP 2000»
14 years 2 months ago
Distance Computation between Non-Convex Polyhedra at Short Range Based on Discrete Voronoi Regions
An algorithm for calculating the minimum distance between non-convex polyhedra is described. A polyhedron is represented by a set of triangles. In calculating the distance between...
Katsuaki Kawachi, Hiromasa Suzuki