388 search results - page 41 / 78 » Discrete Hamilton-Jacobi theory and discrete optimal control |
COMPGEOM
1995
ACM
13 years 11 months ago
1995
ACM
A convex polytope P can be speci ed in two ways: as the convex hull of the vertex set V of P, or as the intersection of the set H of its facet-inducing halfspaces. The vertex enum...
PODC
2003
ACM
14 years 26 days ago
2003
ACM
All too often a seemingly insurmountable divide between theory and practice can be witnessed. In this paper we try to contribute to narrowing this gap in the field of ad-hoc rout...
SODA
2000
ACM
13 years 9 months ago
2000
ACM
We present a model that enables us to analyze the running time of an algorithm on a computer with a memory hierarchy with limited associativity, in terms of various cache parameter...
ECCV
2008
Springer
14 years 9 months ago
2008
Springer
We consider the problem of imaging a scene with a given depth of field at a given exposure level in the shortest amount of time possible. We show that by (1) collecting a sequence ...
EOR
2006
13 years 7 months ago
2006
In this paper we use policy-iteration to explore the behaviour of optimal control policies for lost sales inventory models with the constraint that not more than one replenishment...