108 search results - page 17 / 22 » Computational Complexity of Planning with Temporal Goals |
CGF
2004
14 years 9 months ago
2004
In recent years it has been shown that, above a certain complexity, points become the most efficient rendering primitives. Although the programmability of the lastest graphics har...
DAGSTUHL
2001
14 years 11 months ago
2001
Planetary rovers are small unmanned vehicles equipped with cameras and a variety of sensors used for scientific experiments. They must operate under tight constraints over such res...
FIS
2008
14 years 11 months ago
2008
Most of the efforts conducted on services nowadays are focusing on aspects related to data and control flow, often disregarding the main goal of the future Internet of services, na...
NIPS
1993
14 years 11 months ago
1993
Dynamic programming provides a methodology to develop planners and controllers for nonlinear systems. However, general dynamic programming is computationally intractable. We have ...
COCOON
2010
Springer
15 years 2 months ago
2010
Springer
The persistent homology provides a mathematical tool to describe “features” in a principled manner. The persistence algorithm proposed by Edelsbrunner et al. [9] can compute n...