284 search results - page 2 / 57 » On Some Polyhedra Covering Problems |
NIPS
2007
13 years 7 months ago
2007
Point-based algorithms have been surprisingly successful in computing approximately optimal solutions for partially observable Markov decision processes (POMDPs) in high dimension...
SIAMDM
2008
13 years 6 months ago
2008
The Windy Postman Problem consists of finding a minimum cost traversal of all the edges of an undirected graph with two costs associated with each edge, representing the costs of ...
CORR
2006
Springer
13 years 6 months ago
2006
Springer
Suppose we are given a set of objects that cover a region and a duration associated with each object. Viewing the objects as jobs, can we schedule their beginning times to maximiz...
COMPGEOM
1990
ACM
13 years 10 months ago
1990
ACM
Practical solid modeling systems are plagued by numerical problems that arise from using oatingpoint arithmetic. For example, polyhedral solids are often represented by a combinat...
IEEEPACT
1998
IEEE
13 years 10 months ago
1998
IEEE
We study in this paper the problem of polyhedron scanning which appears for example when generating code for transformed loop nests in automatic parallelization. After a review of...