914 search results - page 39 / 183 » The Computational Complexity of Probabilistic Planning |
COCO
2005
Springer
14 years 4 months ago
2005
Springer
The inertia of an n × n matrix A is defined as the triple (i+(A), i−(A), i0(A)), where i+(A), i−(A), and i0(A) are the number of eigenvalues of A, counting multiplicities, w...
ICRA
2007
IEEE
14 years 4 months ago
2007
IEEE
— We introduce a method for constructing provably safe smooth feedback laws for car-like robots in obstaclecluttered polygonal environments. The robot is taken to be a point with...
VLSM
2005
Springer
14 years 3 months ago
2005
Springer
Current state-of-the-art methods in variational image segmentation using level set methods are able to robustly segment complex textured images in an unsupervised manner. In recent...
IWPEC
2009
Springer
14 years 5 months ago
2009
Springer
We introduce a new approach for establishing fixed-parameter tractability of problems parameterized above tight lower bounds or below tight upper bounds. To illustrate the approac...
COMPGEOM
2005
ACM
14 years 11 days ago
2005
ACM
We introduce a new type of diagram called the VV(c)-diagram (the visibility–Voronoi diagram for clearance c), which is a hybrid between the visibility graph and the Voronoi diag...